Premium
The superregular graphs
Author(s) -
West Douglas B.
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(199611)23:3<289::aid-jgt8>3.0.co;2-o
Subject(s) - combinatorics , mathematics , cartesian product , vertex (graph theory) , cograph , chordal graph , discrete mathematics , clique sum , indifference graph , graph , 1 planar graph
A regular graph is superregular if it has no vertices or if the subgraphs induced by the neighbors and by the nonneighbors of each vertex are superregular. The superregular graphs are precisely the disjoint union of m isomorphic cliques, the Cartesian product of two isomorphic cliques, the five‐cycle, and the complements of these graphs. © 1996 John Wiley & Sons, Inc.