Invariants of E-Graphs
Document Type
Article
Publication Date
1-1-1995
Description
An E-graph is constructed by replacing each edge in a core graph G with a copy of a graph H. An important property of E-graphs is that their invariant values can be determined from parameters of the original graphs G and H. We determine chromatic number, clique number, vertex and edge cover numbers, vertex and edge independence numbers, circumference, and girth of E-graphs. A characterization of hamiltonian E-graphs is also given.
Citation Information
Haynes, Teresa W.. 1995. Invariants of E-Graphs. International Journal of Computer Mathematics. Vol.55(1-2). 19-27. https://doi.org/10.1080/00207169508804359 ISSN: 0020-7160