A note on the degree condition of completely independent spanning trees

Hung Yi Chang, Hung Lung Wang, Jinn Shyong Yang, Jou Ming Chang

研究成果: 雜誌貢獻期刊論文同行評審

28 引文 斯高帕斯(Scopus)

摘要

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 [n/3] completely independent spanning trees.

原文英語
頁(從 - 到)2191-2193
頁數3
期刊IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E98A
發行號10
DOIs
出版狀態已發佈 - 2015 10月 1
對外發佈

ASJC Scopus subject areas

  • 訊號處理
  • 電腦繪圖與電腦輔助設計
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「A note on the degree condition of completely independent spanning trees」主題。共同形成了獨特的指紋。

引用此