The Spanning Connectivity of the Burnt Pancake Graphs

スポンサーリンク

概要

• 論文の詳細を見る

• 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 κ(G) be the connectivity of G. A graph G is super spanning connected if G is i*-connected for 1 ≤ i ≤ κ(G). In this paper, we prove that the n-dimensional burnt pancake graph Bn is super spanning connected if and only if n ≠ 2.

• 2009-03-01

著者

• Weng Tien-hsiung

  Department Of Computer Science And Information Engineering Providence University

• HSU Lih-Hsing

  Department of Computer and Information Science, National Chiao Tung University

• Hsu Lih-hsing

  Department Of Computer Science And Information Engineering Providence University

• CHIN Cherng

  Department of Computer Science and Communication Engineering, Providence University

• CHIOU Shang-Chia

  Graduate School of Design, National Yunlin University of Science and Technology

• Chin Cherng

  Department Of Computer Science And Communication Engineering Providence University

• Chiou Shang-chia

  Graduate School Of Design National Yunlin University Of Science And Technology

関連論文

• The Spanning Connectivity of the Burnt Pancake Graphs
• On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes
• THE PRACTICE AND VALUE OF BIONIC DESIGN THINKING

スポンサーリンク