依赖团数的有向图极大与超级边连通的度序列条件

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

英文篇名：Degree Sequence Conditions for Maximally and Super Edge-Connected Digraphs Depending on the Clique Number 作者：王晓丽 英文作者：WANG Xiao-li;School of Mathematics and Physics, Jinzhong University; 关键词：团数 ; 弧连通度 ; 度序列 英文关键词：clique number;;arc-connectivity;;degree sequence 中文刊名：SSJS 英文刊名：Mathematics in Practice and Theory 机构：晋中学院数理学院; 出版日期：2019-01-08 出版单位：数学的实践与认识 年：2019 期：v.49 基金：国家自然科学基金(61070229);; 2016年度晋中学院博士基金科研项目(bsjj2016202) 语种：中文; 页：SSJS201901034 页数：4 CN：01 ISSN：11-2018/O1 分类号：254-257

摘要

互连网络通常以有向图为模型,有向图的弧连通度是网络可靠性的一个重要参数.给出了依赖团数的有向图极大和超级边连通的度序列条件.
        Interconnection networks are often modeled by digraphs. The arc-connectivity of a digraph is an important measurement for fault tolerance of networks. In this paper,we present degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number.

引文

[1] Bang-Jensen Jorgen, Gutin Gregory. Digraphs Theory, Algorithms and Applications[M]. London:Springer-Verlag, 2001.
    [2] Turán P. An extremal problem in graph theory[J]. Matematikaiés Fizikai Lapok, 1941, 48:436-452.
    [3]王晓丽,王世英.非极大弧连通有向图弧连通度的下界[J].山东科学,2014, 27(1):98-101.
    [4] Hellwig A, Volkmann. L. Lower bounds on the vertex-connectivity of digraphs and graphs[J].Information Processing Letters, 2006, 99(2):41-46.