A graph and its complement with specified properties. IV. Counting self‐complementary blocks

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.Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/143656/1/3190050108_ftp.pd