A graph and its complement with specified properties I: connectivity

Jin Akiyama and Frank Harary

International Journal of Mathematics and Mathematical Sciences, 1979, vol. 2, 1-6

Abstract:

We investigate the conditions under which both a graph G and its complement G ¯ possess a specified property. In particular, we characterize all graphs G for which G and G ¯ both (a) have connectivity one, (b) have line-connectivity one, (c) are 2 -connected, (d) are forests, (e) are bipartite, (f) are outerplanar and (g) are eulerian. The proofs are elementary but amusing.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2/302453.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2/302453.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:302453

DOI: 10.1155/S016117127900020X

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().