期刊
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
卷 E98A, 期 10, 页码 2191-2193出版社
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
DOI: 10.1587/transfun.E98.A.2191
关键词
completely independent trees; Dirac's condition; Ore's condition
类别
资金
- MOST [103-2221-E-141-001, 103-2221-E-141-004, 103-2221-E-141-003]
Given a graph G, a set of spanning trees of G are completely independent 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. In this paper, we prove that for graphs of order n, with n >= 6, if the minimum degree is at least n - 2, then there are at least left perpendicular n/3 right perpendicular completely independent spanning trees.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据