Name
Abstract | ||
|---|---|---|
Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 <= w <= k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w*-container if it contains all the vertices of G. A graph G is w*-connected if there exists a w*-container between any two distinct vertices. Let K(G) be the connectivity of G. A graph G is super spanning connected if G is i*-connected for 1 <= i <= K(G). In this paper, we prove that the n-dimensional burnt pancake graph B(n) is super spanning connected if and only if n not equal 2. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transinf.E92.D.389 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
interconnection networks, Hamiltonian cycles, Hamiltonian connected, container | Discrete mathematics,Combinatorics,Strongly regular graph,Bound graph,Graph factorization,Neighbourhood (graph theory),Distance-regular graph,Shortest-path tree,Connectivity,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
E92D | 3 | 0916-8532 |
Citations | PageRank | References |
9 | 0.52 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cherng Chin | 1 | 12 | 1.67 |
| Tien-hsiung Weng | 2 | 88 | 11.13 |
| Lih-Hsing Hsu | 3 | 1899 | 134.22 |
| Shang-Chia Chiou | 4 | 11 | 1.57 |