ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2018-2019): c. 84%

Discussiones Mathematicae Graph Theory


Discussiones Mathematicae Graph Theory 27(2) (2007) 345-357
DOI: 10.7151/dmgt.1366


Ludovít Niepel

Department of Mathematics and Computer Science
Kuwait University
P.O. Box 5969, Safat, 13060, Kuwait


For a given graph G and a positive integer r the r-path graph, Pr(G), has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r−1, and their union forms either a cycle or a path of length k+1 in G. Let Pkr(G) be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of Pkr(G). The k-history P−kr(H) is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.

Keywords: path-graph, graph dynamics, history.

2000 Mathematics Subject Classification: 05C38, 05C75.


[1] R.E.L. Aldred, M.N. Ellingham, R. Hemminger and P. Jipsen, P3-isomorphism for graphs, J. Graph Theory 26 (1997) 35-51, doi: 10.1002/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO;2-I.
[2] C. Balbuena and D. Ferrero, Edge-connectivity and super edge-connectivity of P2-path graphs, Discrete Math. 269 (2003) 13-20, doi: 10.1016/S0012-365X(02)00828-2.
[3] C. Balbuena and P. García-Vázquez, Edge-connectivity in Pk-path graphs, Discrete Math. 286 (2004) 213-218, doi: 10.1016/j.disc.2004.05.007.
[4] H.J. Broersma and C. Hoede, Path graphs, J. Graph Theory 13 (1989) 427-444, doi: 10.1002/jgt.3190130406.
[5] D. Ferrero, Edge connectivity of iterated P3-path graphs, Congr. Numer. 155 (2002) 33-47.
[6] D. Ferrero, Connectivity of path graphs, Acta Mathematica Universitatis Comenianae LXXII (1) (2003) 59-66.
[7] M. Knor and L. Niepel, Diameter in iterated path graphs, Discrete Math. 233 (2001) 151-161, doi: 10.1016/S0012-365X(00)00234-X.
[8] M. Knor and L. Niepel, Centers in path graphs, JCISS 24 (1999) 79-86.
[9] M. Knor and L. Niepel, Independence number in path graphs, Computing and Informatics 23 (2004) 179-187.
[10] H. Li and Y. Lin, On the characterization of path graphs, J. Graph Theory 17 (1993) 463-466, doi: 10.1002/jgt.3190170403.
[11] X. Li, Isomorphism of P3-graphs, J. Graph Theory 21 (1996) 81-85, doi: 10.1002/(SICI)1097-0118(199601)21:1<81::AID-JGT11>3.0.CO;2-V.
[12] L. Niepel, M. Knor and L. Soltés, Distances in iterated line graphs, Ars Combin. 43 (1996) 193-202.
[13] E. Prisner, Graph dynamics, Pitman Research Notes in Mathematics Series Vol 338 (Longman, Essex, 1995).
[14] E. Prisner, Recognizing k-path graphs, Discrete Appl. Math. 99 (2000) 169-181, doi: 10.1016/S0166-218X(99)00132-8.
[15] E. Prisner, The dynamics of the line and path graph operators, Discrete Math. 103 (1992) 199-207, doi: 10.1016/0012-365X(92)90270-P.
[16] X. Yu, Trees and unicyclic graphs with hamiltonian path graphs, J. Graph Theory 14 (1990) 705-708, doi: 10.1002/jgt.3190140610.

Received 15 May 2006
Revised 15 January 2007
Accepted 15 January 2007