Bounds are obtained for the maximum average connectivity over orientations and the ratio to undirected average connectivity for graphs in specified classes, extending prior tree results with sharpness demonstrations where possible.
Mader, Ecken vom Grad n in minimalen n-fach zusammenh¨ angenden Graphen, Arch
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The maximum average connectivity among all orientations of a graph
Bounds are obtained for the maximum average connectivity over orientations and the ratio to undirected average connectivity for graphs in specified classes, extending prior tree results with sharpness demonstrations where possible.