期刊
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
卷 E100A, 期 9, 页码 1932-1935出版社
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
DOI: 10.1587/transfun.E100.A.1932
关键词
completely independent spanning trees; chordal rings; distributed loop networks
类别
资金
- Ministry of Science and Technology, Taiwan [MOST-104-2221-E-141-002-MY3]
Given a graph G, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. Hasunuma (2001, 2002) first introduced the concept of CISTs and conjectured that there are k CISTs in any 2k connected graph. Later on, this conjecture was unfortunately disproved by Peterfalvi (2012). In this note, we show that Hasunuma's conjecture holds for graphs restricted in the class of 4-regular chordal rings CR(n, d), where both n and d are even integers.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据