平衡半传递有向图的弧连通性(英文)

张崧; 田应智; 孟吉翔

您当前的位置：

首页 >

文章列表页 >

平衡半传递有向图的弧连通性(英文)

更新时间：2026-01-21

- 平衡半传递有向图的弧连通性(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 31, Issue 1, Pages: 22-25(2014)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2014
- 稿件说明：
移动端阅览
[1]张崧,田应智,孟吉翔.平衡半传递有向图的弧连通性(英文)[J].新疆大学学报(自然科学版),2014,31(01):22-25.

张崧, 田应智, 孟吉翔. 平衡半传递有向图的弧连通性(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(1): 22-25.
[1]张崧,田应智,孟吉翔.平衡半传递有向图的弧连通性(英文)[J].新疆大学学报(自然科学版),2014,31(01):22-25. DOI：

张崧, 田应智, 孟吉翔. 平衡半传递有向图的弧连通性(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(1): 22-25. DOI：

摘要

有向图D=(V

E)被称为是极大弧连通的

如果λ(D)=δ(D).此外

有向图D被称为是超弧连通的

如果每个最小的弧割都是其某个点的入弧集或者出弧集.以X1和X2为两部的一个有向二部图是半传递的

如果自同构群Aut(D)分别传递的作用在X1和X2上.在这篇论文中

证明了强连通的半传递有向图是极大弧连通的.还证明了除了少部分例外

连通半传递平衡有向图是超弧连通的.

Abstract

The digraph D =(V

E) is said to be maximally arc-connected

if λ(D) = δ(D).Moreover

the digraph D is said to be super arc-connected

if every minimum arc cut of D is the set of the in-arcs or the out-arcs of some vertex of D.A bipartite digraph D with bipartition X1and X2is half-transitive if Aut(D) acts transitively on X1and X2

respectively.In this paper

we prove that each strongly connected half-transitive digraph is maximally arc-connected.Moreover

we prove that for all but a few exceptions

the connected half-transitive balanced digraph is super arc-connected.

关键词

Keywords

references

Bondy J A.Graph Theory with Applications[M].New York:North-Holland,1976.

Godsil C,Royle G.Algebraic Graph Theory[M].New York:Springer-Verlag,2001.

Watkins M E.Connectivity of transitive graphs[J].Combin Theory,1970,8:23-29.

Boesch F.Synthesis of reliable networks:a survey[J].IEEE Trans Reliab,1986,35:240-246.

Harary F.Conditional connectivity[J].Networks,1983,13:347-357.

Hamidoune Y O,Tindell R.Vertex transitivity and super line connectedness[J].SIAM J Discrete Mathematics,1990,3:524-530.

Tindell R.Connectivity of Cayley digraphs[M].Netherlands:Kluwer Academic Publishers,1996.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰