邻接叶边交换森林图的连通性被引量：1

The connectivities of the adjacency leaf exchange forest graphs

下载PDF

导出

摘要证明了若图G是 2 连通的 ,则图G的邻接叶边交换森林图是连通的 . It is proved that the adjacent leaf exchange forest graph of G is connected if the graph G is 2-connected.

作者李乐学刘桂真

机构地区山东大学数学与系统科学学院

出处《山东大学学报（理学版）》 CAS CSCD 北大核心 2004年第6期49-51,57,共4页 Journal of Shandong University(Natural Science)

基金国家自然科学基金资助项目 (60 172 0 0 3 )

关键词树图森林图邻接叶边交换森林图 Tree graph Forest graph adjacency leaf exchange forest graph

参考文献8

1R L Cummins. Hamilton circuits in tree graphs[ J]. IEEE Trans Circuit theory, 1966:82 ～ 90.
2G Liu, The Connectivities of Adjacent Tree Graphs[J] .Acta Mathematicae Applicatae Sinica, 1987,3(4):313 ～ 317.
3H Harary, R J Mokken and M J Plantholt, Interpolation theorem for diameters of spanning trees[J]. IEEE Trans Circuits and System,1983,30:429 ～ 432.
4F Harary and M J Plantholt, Classification of interpolation theorems for spanning trees and other families of spanning subgraphs[J]. J Graph Theory, 1989,13(6) :703 ～ 712.
5Li X L. The Connectivity of the SEE-graphs and the AEE-graph for the connected spanning k-Edge subgraphs of a graph[J]. Discrete Math, 1998, 183: 237～245.
6Zhang L. Forest graphs of graphs[ D]. Jinan: School of Mathematics and System Science of Shsndong University, 2001.
7J A Bondy, U S R Murty, Graph theory with applications[M]. New York: Macmillan, 1976.
8A Bjoner, G M Ziegler, Introduction to Greedoids: Combinatorial Geometries. Advanced Theory[ M]. Cambridge: Cambridge University Press, 1992.

山东大学学报（理学版）

2004年第6期

内容加载中请稍等...