ON THE HONESTY OF GRAPH COMPLEMENTS

Authors
BAGGA KS BEINEKE LW LIPMAN MJ PIPPERT RE
Citation
Ks. Bagga et al., ON THE HONESTY OF GRAPH COMPLEMENTS, Discrete mathematics, 122(1-3), 1993, pp. 1-6
Citations number
3
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Discrete mathematics → ACNP
ISSN journal
0012365X
Volume
122
Issue
1-3
Year of publication
1993
Pages
1 - 6
Database
ISI
SICI code
0012-365X(1993)122:1-3<1:OTHOGC>2.0.ZU;2-2
Abstract
A graph is called honest if its edge-integrity equals its order. It is shown in this paper that except for the path of length 3, every graph that is not honest has an honest complement. This result is extended to complements of products and applied to the Nordhaus-Gaddum theory f or edge-integrity.