Article contents
A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
Published online by Cambridge University Press: 01 March 2000
Abstract
The core of a graph G is the subgraph GΔ induced by the vertices of maximum degree. We define the deleted core D(G) of G. We extend an earlier sufficient condition due to Hoffman [7] for a graph H to be the core of a Class 2 graph, and thereby provide a stronger sufficient condition. The new sufficient condition is in terms of D(H). We show that in some circumstances our condition is necessary; but it is not necessary in general.
- Type
- Research Article
- Information
- Copyright
- 2000 Cambridge University Press
- 3
- Cited by