Strongly 4 -path-connectivity in almost regular multipartite tournaments
- 作者：Irene Stella ; Lutz Volkmann ; Stefan Winzen
- 关键词：Multipartite tournament ; Path
- 刊名：Discrete Mathematics
- 出版年：2007
- 期刊代码：47_0012365x
- 类别：cp
- 出版时间：28 November 2007
- 卷：307
- 期：24
- 页码：3213-3219
- 文件大小：164 K
摘要
If x is a vertex of a digraph D, denote by d+(x) and d-(x) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is defined by ig(D)=max{d+(x),d-(x)}-min{d+(y),d-(y)} over all vertices x and y of D (including x=y). If ig(D)=0, then D is regular and if ig(D)
1, then D is almost regular. A digraph D is said to be strongly k-path-connected if for any two vertices x,y
V(D) there is an (x,y)-path of order 1a5082f001ab16c" title="Click to view the MathML source">k and a (y,x)-path of order k in 1a59e7dddf81591fc" title="Click to view the MathML source">D. In this paper we show that an almost regular 01ab712c4763ab659df392bbba959" title="Click to view the MathML source">c-partite tournament with c
8 is strongly 4-path-connected. Examples show that the condition c8 is best possible.
1, then D is almost regular. A digraph D is said to be strongly k-path-connected if for any two vertices x,yV(D) there is an (x,y)-path of order 1a5082f001ab16c" title="Click to view the MathML source">k and a (y,x)-path of order k in 1a59e7dddf81591fc" title="Click to view the MathML source">D. In this paper we show that an almost regular 01ab712c4763ab659df392bbba959" title="Click to view the MathML source">c-partite tournament with c8 is strongly 4-path-connected. Examples show that the condition c8 is best possible.