Path graphs

Share/Save/Bookmark

Broersma, H.J. and Hoede, C. (1989) Path graphs. Journal of Graph Theory, 13 (4). pp. 427-444. ISSN 0364-9024

open access
[img]
Preview
PDF
765kB
Abstract:The concept of a line graph is generalized to that of a path graph. The path graph Pk(G) of a graph G is obtained by representing the paths Pk in G by vertices and joining two vertices whenever the corresponding paths Pk in G form a path Pk+1 or a cycle Ck. P3-graphs are characterized and investigated on isomorphism and traversability. Trees and unicyclic graphs with hamiltonian P3-graphs are characterized.
Item Type:Article
Copyright:© 1989 Wiley InterScience
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70879
Official URL:http://dx.doi.org/10.1002/jgt.3190130406
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page