The average connectivity of a digraph

DOI10.1016/j.dam.2003.04.003zbMath1047.05024OpenAlexW2047797996MaRDI QIDQ1827842

Michael A. Henning, Ortrud R. Oellermann

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.04.003

zbMATH Keywords

tournamentsoriented graphsoriented treesaverage connectivity

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (8)

The maximum average connectivity among all orientations of a graph ⋮ On orientations maximizing total arc-connectivity ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ On the Wiener index of orientations of graphs ⋮ The average scattering number of graphs ⋮ Optimal Orientation On-Line

Cites Work

• Unnamed Item
• Bounds on the average connectivity of a graph
• The average connectivity of a graph
• On the Steiner median of a tree
• On the sum of all distances in a graph or digraph

This page was built for publication: The average connectivity of a digraph