Premium
Isomorphisms of P 3 ‐graphs
Author(s) -
Li Xueliang
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199601)21:1<81::aid-jgt11>3.0.co;2-v
Subject(s) - combinatorics , mathematics , graph isomorphism , isomorphism (crystallography) , vertex (graph theory) , chordal graph , discrete mathematics , graph , line graph , chemistry , crystal structure , crystallography
For graphs G and G ′ with minimum degree at least 3 and satisfying one of three other conditions, we prove that any isomorphism from the P 3 ‐graph P 3 ( G ) onto P 3 ( G ′) can be induced by a (vertex‐) isomorphism of G onto G ′. This in some sense can be viewed as a counterpart with respect to P 3 ‐graphs for Whitney's result on line graphs. © 1996 John Wiley & Sons, Inc.