双轨道有向图的超弧连通性并分析.pdfVIP

摘 要 摘 要 图的连通度是图的重要的参数之一. 由于计算机网络的拓扑结构往往被抽象为一个 图, 所以图的一个重要参数连通度就被广泛研究, 而且随着时间的推移和科学的进步连 通度的研究也更加深入. 人们已经不满足于最早的（边）连通度, 而是提出了各种各样 的高阶连通性的概念, 比如super − λ 性( super − κ 性), 限制性的边连通性,超限制边连 通性等等, 也做了相当多的研究. 当然也取得了相当多的研究成果. 然而对于点传递图 （单点轨道图）和边传递图（单边轨道图）的各类连通度问题的研究方面, 已经有了许 多的研究成果. 我们考虑比点传递图相对较弱而且有趣的情况：双轨道图. 如果设v ∈ V (G), 则称点集 {v : g ∈ Aut(G)} 是Aut(G) 的一个轨道. 如果一个图 恰好有两个轨道, 就称该图是双轨道图. 本文主要研究正则双轨道有向图的超弧连通性 问题. 第一章, 主要介绍相关概念. 第二章, 我们首先研究了双轨道有向图的 λ-超原子, 然后研究了正则双轨道有向图的超弧连通性问题, 主要结果是证明了一个强连通且围 长g (D) ≥ k + 1 的正则双轨道有向图的超弧连通性. 关键词: 轨道; 有向图; 超弧连通性; 围长 – i – Abstract The connectivity is one of the important parameter of graphs. The underlying to pology of a network is often modedled as a graph. The concept of connectivity in graph theory is an important measure for the networks. With the passage of time and research progress of science the research of connectivity in depth. People have been satisfied with the first (edge) connectivity. For further study, many variations have been introduced, which are known as higher connectedness, such as super − λ ( super − κ ), restricted edge connectivity and super-restricted edge connectedness etc, also done a lot of research and have a lot of research. However, the study of transitive graphs (one orbit) and edge transitive graphs (one edge orbit) have a lot of research. We consider relatively weaker case than transitive graphs: graphs with two orbits. We call the set {v : g ∈ Aut(G)} an orbit of Aut(D), if v ∈ V (G). A graph is called double − orbit graph if it contains exactly two orbits. In this paper, we mainly study the super arc-connected regular digraphs with two orbits.