✦ LIBER ✦
A graph and its complement with specified properties. IV. Counting self-complementary blocks
✍ Scribed by Jin Akiyama; Frank Harary
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 220 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this series, we investigate the conditions under which both a graph G and its complement G possess certain specified properties. We now characterize all the graphs G such that both G and G have the same number of endpoints, and find that this number can only be 0 or 1 or 2. As a consequence, we are able to enumerate the self‐complementary blocks.