✦ LIBER ✦

Path graphs

✍ Scribed by H. J. Broersma; C. Hoede

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 766 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130406

No coin nor oath required. For personal study only.

✦ Synopsis

The concept of a line graph is generalized to that of a path graph. The path graph f,(G) of a graph G is obtained by representing the paths Pk in G by vertices and joining two vertices whenever the corresponding paths f k in G form a path f k + , or a cycle C,. f,-graphs are characterized and investigated on isomorphism and traversability. Trees and unicyclic graphs with hamiltonian /?,-graphs are characterized.

📜 SIMILAR VOLUMES

Hamiltonian path graphs

✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia

Path-positive graphs

✍ R.B. Bapat; A.K. Lal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1023 KB

Path connected graphs

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB

Path-Bicolorable Graphs

✍ Andreas Brandstädt; Martin Charles Golumbic; Van Bang Le; Marina Lipshteyn 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 344 KB

On Path-amenable Graphs

✍ Gabriel Dirac; Ove Steen Nielsen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

Path-connectivity in graphs

✍ Michael Hager 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 420 KB