By Topic

Edge number of 3-connected diameter 3 graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ming-Chun Tsai ; Dept. of Bus. Adm., Chung Hua Univ., Hsinchu, Taiwan ; Fu, H.-L.

Let the decay number, ζ(G) be the minimum number of components of a cotree of a connected graph G. Let Ω be the collection of all 3-connected diameter 3 graphs. In this paper, we prove that if k is the minimum number such that q ≥ 2p - k for each (p,q)-graph G ε Ω, and 1 is the minimum number such that ζ(H) ≤ l - 1 for each graph H ε Ω, then k=l. Furthermore, we prove that k ≤ 11 and we find a 3-connected, diameter 3 graph with q = 2p - 8. So we have that 8 ≤ k ≤ 11 and we conjecture that k = 8.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004