THE LONGEST CYCLE IN 2-CONNECTED GRAPHS

THE LONGEST CYCLE IN 2-CONNECTED GRAPHS

导出

摘要 Let G=(V,E)be a simple, undirected graph, |V|=n. Denote N_i(u)={x∈V|d(x, u)=i}, i≥1, where d(x, u) is the distance between two vertices x and u of G. By using the degree of vertices of G to discuss the longest cycle of G, the

作者陈冠涛卫兵吴海东

机构地区 Department of Mathematics China People's University

出处《Chinese Science Bulletin》 SCIE EI CAS 1987年第21期1507-,共1页

关键词 undirected CYCLE VERTEX otherwise LETTER PROFOUND

分类号 O1 [理学—基础数学]

引文网络
相关文献

1吴正声.LONGEST CYCLES IN κ-CONNECTED K_(1,3)-FREE GRAPHS[J].Chinese Science Bulletin,1988,33(4).
2XIE Xin,XU Jun Ming.（n, 2n）-Dominating Numbers of Undirected Toroidal Mesh C（3,3,...,3）[J].Journal of Mathematical Research and Exposition,2008,28(2):266-272.
3Ruibin Qu.A DIRECTED GRAPH ALGORITHM OF VARIATIONAL GEOMETRY BASED ON GEOMETRIC REASONING[J].Computer Aided Drafting,Design and Manufacturing,1995,5(2):44-52.
4刘桂真.On (g, f)-Uniform Graphs[J].数学进展,2000,29(3):285-287. 被引量：4
5方新贵,王敏.A PACKING PAIR OF GRAPHS {(P,P-1), (P,P)} AND SLATER'S PROBLEMS[J].Chinese Science Bulletin,1988,33(16):1402-1403.
6Xiaodong CHEN,Mingchu LI,Xin MA.Longest Cycles in 2-Connected Quasi-Claw-Free Graphs[J].Journal of Mathematical Research with Applications,2014,34(1):33-42.
7孙良.ISOMORPHISM OF UNDIRECTED CIRCULANT GRAPHS[J].Chinese Science Bulletin,1987,32(16).
8于祖荣.NN RESONANCE IN THE QUARK MODEL[J].Chinese Science Bulletin,1981,26(10):883-887.
9杜一宏.A NOTE ABOUT A THEOREM OF AMANN[J].Chinese Science Bulletin,1986,31(24).
10Zhao Kewen, Chen Deqin (Department of Mathematics, Qiongzhou University, Wuzhishan, Hainan 572200, P.R.China).Essential Independent Condition for Graphs to Be Hamiltonian[J].工程科学（英文版）,2007,5(2):184-190.

Chinese Science Bulletin

1987年第21期

浏览历史

内容加载中请稍等...

THE LONGEST CYCLE IN 2-CONNECTED GRAPHS

相关作者

相关机构

相关主题

浏览历史