Abstract

Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order three. We prove that the Betti deficient number of G, ξ (G)≤ 2. ie the maximum genus of G, ум (G)≥ ẞ (G)–1 in this paper, which is related with

Date

2007

Authors

Xiang Ren, WeiLi He, Lin Zhao

Journal

International Journal of Mathematical Combinatorics, Volume 1, 2007

Volume

1

Issue

1

Pages

87-93

Publisher

Infinite Study