Premium
A graph and its complement with specified properties. IV. Counting self‐complementary blocks
Author(s) -
Akiyama Jin,
Harary Frank
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050108
Subject(s) - mathematics , complement (music) , combinatorics , graph , discrete mathematics , biochemistry , chemistry , complementation , gene , phenotype
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.