Spelling suggestions: "subject:"vertex anda edge independence numbers"" "subject:"vertex ando edge independence numbers""
1 |
Invariants of E-GraphsHaynes, Teresa W. 01 January 1995 (has links)
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.
|
Page generated in 0.1319 seconds