The average connectivity of a graph
From MaRDI portal
Publication:1613484
DOI10.1016/S0012-365X(01)00180-7zbMath1002.05040OpenAlexW2048460015MaRDI QIDQ1613484
Ortrud R. Oellermann, Raymond E. Pippert, Lowell W. Beineke
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00180-7
Related Items (21)
The maximum average connectivity among all orientations of a graph ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ Asymptotic connectivity of hyperbolic planar graphs ⋮ Tree robustness of a graph ⋮ Average connectivity and average edge-connectivity in graphs ⋮ Coefficient of domination in graph ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ Uniformly connected graphs ⋮ The path-index of a graph ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Efficient presolving methods for the influence maximization problem ⋮ Uniformly 3‐connected graphs ⋮ Bounds on the average connectivity of a graph ⋮ Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs ⋮ On average connectivity of the strong product of graphs ⋮ Optimal Orientation On-Line ⋮ Asymptotic connectivity of infinite graphs ⋮ The average connectivity of a digraph ⋮ Unnamed Item ⋮ On the average order of a dominating set of a forest
This page was built for publication: The average connectivity of a graph
