Abstract
The average connectivity of a digraph is the average, over all ordered pairs of vertices, of the maximum number of internally disjoint directed paths connecting these vertices. Among the results in this paper, we determine the minimum average connectivity among all orientations of the complete multipartite graph Kn1,n2,...,nk and the maximum average connectivity when all partite sets have the same order.
| Original language | English |
|---|---|
| Pages (from-to) | 101-113 |
| Number of pages | 13 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 23 |
| Publication status | Published - 2001 |
| Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics