Ⅱ-类具有两个边轨道图的点连通性

详细信息    查看全文 | 推荐本文 |

	英文篇名：Vertex Connectivity of Ⅱ-kind Graph with Two Edge Orbits 作者：侯学慧 英文作者：HOU Xuehui;Department of Information Security,Xinjiang Police College; 关键词：边轨道 ; 点轨道 ; 原子 ; 连通度 英文关键词：edge orbit;;vertex orbit;;atom;;connectivity 中文刊名：YXSG 英文刊名：Journal of Yuxi Normal University 机构：新疆警察学院信息安全工程系; 出版日期：2017-04-20 出版单位：玉溪师范学院学报 年：2017 期：v.33;No.276 语种：中文; 页：YXSG201704004 页数：5 CN：04 ISSN：53-1166/G4 分类号：24-28

摘要

对Ⅱ-类具有两个边轨道图的点连通性进行研究,给出在围长条件下,k-正则Ⅱ-类2-边轨道图点连通度等于最小度的充分条件,并且证明如果k≤6且围长g(G)≥6,则连通度等于最小度.
        The study gave the sufficient condition for the vertext connectivity ofⅡ-kind 2-edge-orbit graph being equal to its minimum degree with positive K and the given girth and proved that if k≤6 and the girth g(G)≥6,the connectivity was equal to its minimum degree.

引文

[1]J.X.Meng,Connectivity of vertex and edge transitive graphs[J].Discrete Apple.Math.,2003(127).601-613.
    [2]C.Godsil and G.Royle.Algebraic graph theory[M].New York,Springer-Verlag,2011.
    [3]R.Tindell.Connectivity of cayley graphs[M].in:D.Z.Du,D.F.Hsu(Eds.).Com-binatorial Network Theory,Kletwey,Dordrech,1996:41-64.
    [4]X.H.Hou.The Vertex Connectivity of Graphs with Two Edge Orbits[J].Shanxi Normal University,2012(3):17-19.
    [5]L.Lovasz.Combinatorial Problems and Exercise[M].Amsterdam,North-Holland.1979.
    [6]W.Mader.Uber den zusammen symmetricher Graphen[J].Arch.Math.,1970(21):331-336.