The focus here is on honest graphs (see the previous review for definitions) with the main result being that if \(G \neq P_ 4\) then \(G\) or \(\overline G\) is honest. As a corollary it follows that every self- complementary graph of order at least 5 is honest thus answering the closing question cited in the previous review. Note that almost all graphs are honest since, as the authors showed earlier [Congr. Numerantium 60, 141-144 (1987; Zbl 0664.05039)]: if \(G\) has diameter 2 then \(G\) is honest. Also, Theorem 8 quoted in the previous review is improved by showing that the conclusion still holds even though the order of \(G\) is 2 unless \(G=K_ 2\) and \(H=K_ 3\).
- scientific article; zbMATH DE number 4139795
- scientific article; zbMATH DE number 4162911
- On the edge-integrity of some graphs and their complements
- Computing the integrity of Harary graphs
- On Integrity of Harary Graphs
- On the complements of graphs
- scientific article; zbMATH DE number 4085694
- scientific article; zbMATH DE number 861416
- Validity up to complementation in graph theory
- On the weak-integrity of graphs
- A survey of integrity
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
- Edge-integrity: A survey
- On the edge-integrity of some graphs and their complements
- Stability measures of some static interconnection networks
- scientific article; zbMATH DE number 140146 (Why is no real title available?)
- The common-neighbourhood of a graph
- On the neighbour-integrity of sequential joined graphs
This page was built for publication: On the honesty of graph complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313844)
