Title of article :
On the sizes of graphs and their powers: The undirected case Original Research Article
Author/Authors :
David Auger، نويسنده , , Irène Charon، نويسنده , , Olivier Hudry، نويسنده , , Iiro Honkala and Antoine Lobstein ، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Abstract :
Let image be an undirected graph and image be its image-th power. We study different issues dealing with the number of edges in image and image. In particular, we answer the following question: given an integer image and all connected graphs image of order image such that image, what is the minimum number of edges that are added when going from image to image, and which are the graphs achieving this bound?
Keywords :
Identifying code , Edge number , Size of a graph , Hamiltonian graph , Transitive closure of a graph , Power of a graph , Graph theory , Undirected graph , Diameter
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
