Do nearly balanced multigraphs have more
โ
Ching-Shui Cheng; Joseph C. Masaro; Chi Song Wong
๐
Article
๐
1985
๐
John Wiley and Sons
๐
English
โ 320 KB
We prove that, with very few exceptions, every graph of order n, n = 0, 1 (mod 4) and size a t most n -1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs. Throughout the paper, G and D will denote a finite graph and a finite digraph, respectively, with