Title of article
Diameter in iterated path graphs Original Research Article
Author/Authors
M. Knor، نويسنده , , L’. Niepel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
11
From page
151
To page
161
Abstract
If G is a graph, then its path graph, Pk(G), has vertex set identical with the set of paths of length k in G, with two vertices adjacent in Pk(G) if and only if the corresponding paths are ‘consecutive’ in G. We study the behavior of diam(P2i(G)) as a function of i, where P2i(G) is a composition P2(P2i−1(G)), with P20(G)=G.
Keywords
Path graph , Line graph , Iterated Path graph , Diameter
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949643
Link To Document