The average connectivity of a digraph
From MaRDI portal
Recommendations
- The average connectivity of regular multipartite tournaments
- Bounds on the average connectivity of a graph
- The maximum average connectivity among all orientations of a graph
- The average connectivity of a graph
- Minimum average distance of strong orientations of graphs
- The average size of a connected vertex set of a \(k\)-connected graph
- Average Distance and Edge-Connectivity I
- scientific article; zbMATH DE number 2114503
- Average distance in graphs with removed elements
- Average distance and domination number revisited
Cites work
Cited in
(13)- Average distance in \(k\)-connected tournaments.
- Optimal Orientation On-Line
- On the average lower bondage number of graphs under join and corona operations
- The average lower reinforcement number of a graph
- Selected topics on Wiener index
- On the Wiener index of orientations of graphs
- The maximum average connectivity among all orientations of a graph
- The average connectivity of a graph
- On the average lower bondage number of a graph
- Bounds on the average connectivity of a graph
- The average scattering number of graphs
- On orientations maximizing total arc-connectivity
- Average distance in bipartite tournaments.
This page was built for publication: The average connectivity of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827842)