Abstract: A large graph is a graph having an important
number of nodes and arcs. When this number is evolving with time, following
operations of addition and suppression of links or nodes, we obtain a sequence
of static graphs. In this case G is
called dynamic graph. The study of a dynamic graph means the determination of
properties of the sequence of its static graphs. However, before making such a
study, we first propose to reduce the two sets V and E. The obtained
graph preserves some properties. Some of them will be shown in this paper.
Keywords and phrases: dynamic graph, reduction of nodes, reduction of arcs, graph of important size.
