By Topic

The spanning diameter of the star 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
$33 $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

3 Author(s)
Cheng-Kuan Lin ; Dept. of Math., Nat. Central Univ., Chung-Li, Taiwan ; Hua-Min Huang ; Hsu, D.F.

Assume that u and v are any two distinct vertices of different partite sets of Sn with n ≥ 5. We prove that there are (n - 1) internally disjoint paths P1, P2, ..., Pn-i joining u to v such that ∪n = 1i = 2 Pi spans Sn and l(Pi) ≤ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q1 and Q2 joining u to v such that Q1 ∪ Q2 spans Sn and l(Qi) ≤ n!/2 + l for i = 1,2.

Published in:

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

Date of Conference:

10-12 May 2004