English

应用科学学报 ›› 1986, Vol. 4 ›› Issue (4): 322-325.

• 论文 • 上一篇    下一篇

关于简单图的Chartrand问题的下界

刘桂真   

  1. 山东大学
  • 收稿日期:1983-11-05 修回日期:1984-05-09 出版日期:1986-12-31 发布日期:1986-12-31

ON THE LOWER BOUND OF CHARTRAND S PROBLEMS IN SIMPLE GRAPHS

LIU GUIZHEN   

  1. Shandong University
  • Received:1983-11-05 Revised:1984-05-09 Online:1986-12-31 Published:1986-12-31

PDF

66

摘要： 本文证明任意一个圈秩为ρ的简单连通图G若含有m个端点及n个端点的撑树,且m < n,则对任意的m < k < n,G至少含有ρ+1个具有k个端点的支撑树.

Abstract: In this paper, it is shown that if a simple connected graph G contains spanning trees having m and n end-vertices respectively and m<n, then for any integer k, m<k<n, G contains, at least, ρ+ spanning trees having k end-vertices where ρ is the circuit rank of G.