On the edge-integrity of some graphs and their complements

DOI10.1016/0012-365X(93)90299-9zbMath0796.05059OpenAlexW1999103501MaRDI QIDQ1313866

B. L. Piazza, Renu C. Laskar, Sam Stueckle

Publication date: 15 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90299-9

zbMATH Keywords

integrityNordhaus-Gaddum type resultshonest graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Connectivity (05C40)

Related Items (4)

Edge Rupture Degree of Graphs ⋮ A survey of integrity ⋮ Edge-integrity: A survey ⋮ On the honesty of graph complements

Cites Work

• The complexity of comparability graph recognition and coloring
• A classification scheme for vulnerability and reliability parameters of graphs
• On the honesty of graph complements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the edge-integrity of some graphs and their complements