On the honesty of graph complements (Q1313844): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3815334 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-integrity: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3789603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the edge-integrity of some graphs and their complements / rank | |||
Normal rank |
Latest revision as of 12:57, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the honesty of graph complements |
scientific article |
Statements
On the honesty of graph complements (English)
0 references
15 September 1994
0 references
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\).
0 references
integrity
0 references
honest graphs
0 references