A graph and its complement with specified properties. I: Connectivity.
A graph and its complement with specified properties. I: Connectivity.
复制标题
DOI:
10.1155/s016117127900020x
复制
发表时间:
1979
影响因子:
1.2
通讯作者:
J. Akiyama;F. Harary
中科院分区:
文献类型:
--
作者:
J. Akiyama;F. Harary
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.