Premium
Generalized line graphs
Author(s) -
Cvetkovic̀ Dragoš,
Doob Michael,
Simic̀ Slobodan
Publication year - 1981
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/jgt.3190050408
Subject(s) - mathematics , combinatorics , indifference graph , chordal graph , line (geometry) , pathwidth , automorphism , clique sum , discrete mathematics , line graph , 1 planar graph , graph , geometry
Generalized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation and construction of the 31 minimal nongeneralized line graphs, a Krausz‐type covering characterization, and Whitney‐type theorems on isomorphisms and automorphisms.