On simple MCD graphs containing a subgra
โ
Yongbing Shi
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 807 KB
Let S. be the set of simple graphs on n vertices in which no two cycles have the same length. A graph G in S. is called a simple maximum cycle-distributed (MCD) graph if there exists no graph G' in S. with IE(G')j >IE(G)I. In this paper, we prove that there exists a simple MCD graph on n vertices su