A graph and its complement with specified properties. IV. Counting self‐complementary blocks
A graph and its complement with specified properties. IV. Counting self‐complementary blocks
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 …