Independent Spanning Trees of Extended Chordal Rings

スポンサーリンク

概要

• 論文の詳細を見る

• A graph G = (V, E) is called a chordal ring and denoted by CR(N, d), if V = {0, 1, …, N- 1} and E = {(u, v) | [v - u]N = 1 or [v - u]N = d, 2 ≦ d ≦ N/2)}, where [v - u]N denotes v - u modulo N. A graph G = (V, E) is called an extended chordal ring and denoted by CR(N, d1, d2), if V = {0, 1, …, N - 1} and E = {(u, v) | [v - u]N = 1 or [v - u]N = di, 1 ≦ i ≦ 2, 2 ≦ di ≦ N/2)}. CR(N, d1, N/2) is 5-connected if N is even. We give an algorithm to construct 5 independent spanning trees of CR(N, d1, N/2), N is even and 2 ≦ d1 ≦ [N/4].

• 2014-02-24

著者

• Yukihiro Hamada

  Department of Electrical and Computer Engineering, Akashi National College of Technology

関連論文

• Independent Spanning Trees of Extended Chordal Rings

スポンサーリンク