A graph and its complement with specified properties I: connectivity

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...

Full description

Bibliographic Details
Main Authors: Jin Akiyama, Frank Harary
Format: Article
Language:English
Published: Hindawi Limited 1979-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S016117127900020X