The Globally Bi-3*-Connected Property of the Brother Trees
Tung-Yang Ho 0, Po-Chun Kuo, Lih-Hsing Hsu
0Ta Hwa Institute of Technology
Available Online October 2006.
- https://doi.org/10.2991/jcis.2006.211How to use a DOI?
- hamiltonian, connectivity, container
- Assume that n is any positive integer. The brother tree BT(n)is an interesting family of 3-regular planar bipartite graphs recently proposed by Kao and Hsu. In any BT(n), we prove that there exist three internally-disjoint spanning paths joining x and y whenever x and y belong to different partite sets. Furthermore, for any three nodes x, y, and z of the same partite set, there exist three internally-disjoint spanning paths of BT(n)-z joining x and y.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Tung-Yang Ho AU - Po-Chun Kuo AU - Lih-Hsing Hsu PY - 2006/10 DA - 2006/10 TI - The Globally Bi-3*-Connected Property of the Brother Trees BT - 9th Joint International Conference on Information Sciences (JCIS-06) PB - Atlantis Press SP - 445 EP - 448 SN - 1951-6851 UR - https://doi.org/10.2991/jcis.2006.211 DO - https://doi.org/10.2991/jcis.2006.211 ID - Ho2006/10 ER -