In:
International Journal of Foundations of Computer Science, World Scientific Pub Co Pte Ltd, Vol. 17, No. 02 ( 2006-04), p. 415-434
Abstract:
A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) is a k*-container if every vertex of G is incident with a path in C(u, v). A graph G is k*-connected if there exists a k*-container between any two distinct vertices u and v. A k-regular graph G is super spanning connected if G is i*-connected for all 1 ≤ i ≤ k. In this paper, we prove that the (n, k)-star graph S n,k is super spanning connected if n ≥ 3 and (n-k) ≥ 2.
Type of Medium:
Online Resource
ISSN:
0129-0541
,
1793-6373
DOI:
10.1142/S0129054106003905
Language:
English
Publisher:
World Scientific Pub Co Pte Ltd
Publication Date:
2006
Bookmarklink