摘要
运用删边缩边原理,探讨了3种减小子树数目的变形,每一种变形都能比较一组图的子树数目的大小。在利用这些变形的基础上,刻画了具有最小子树数目的单圈图和双圈图的结构。
This paper investigates three transformations for decreasing the number of subtrees,each of which can compare the number of subtrees for a pair of graphs.On the basis of these transformations,the unicyclic graph and bicyclic graph with the minimal number of subtrees are proposed.
出处
《江汉大学学报（自然科学版）》
2012年第1期5-7,共3页
Journal of Jianghan University：Natural Science Edition
关键词
子树数目
单圈图
双圈图
the number of subtrees
unicyclic graph
bicyclic graph
