论文信息 - The average connectivity of a digraph

The average connectivity of a digraph

In this paper we consider the concept of the average connectivity of a digraph D defined to be the average, over all ordered pairs (u,v) of vertices of D, of the maximum number of internally disjoint directed u-v paths. We determine sharp bounds on the average connectivity of orientations of graphs in terms of the number of vertices and edges and for tournaments and orientations of trees in terms of their orders. An efficient procedure for finding the maximum average connectivity among all orientations of a tree is described and it is shown that this maximum is always greater than 2/9 and at most ½.

Michael A. Henning | Ortrud R. Oellermann | O. Oellermann | M. Henning

[1] Ortrud R. Oellermann,et al. Bounds on the average connectivity of a graph , 2003, Discret. Appl. Math..

[2] Gary Chartrand,et al. Applied and algorithmic graph theory , 1992 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Ortrud R. Oellermann,et al. The average connectivity of a graph , 2002, Discret. Math..

[5] Ortrud R. Oellermann,et al. on the Steiner Median of a Tree , 1996, Discret. Appl. Math..

[6] Lowell W. Beineke,et al. A classification scheme for vulnerability and reliability parameters of graphs , 1993 .

[7] Ján Plesník,et al. On the sum of all distances in a graph or digraph , 1984, J. Graph Theory.

[8] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[9] Peter Dankelmann. Average Distance and Independence Number , 1994, Discret. Appl. Math..