Bounds on the average connectivity of a graph

DOI10.1016/S0166-218X(02)00572-3zbMath1021.05062MaRDI QIDQ1406026

Peter Dankelmann, Ortrud R. Oellermann

Publication date: 9 September 2003

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

zbMATH Keywords

planar graphschromatic numberCartesian productsaverage degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (8)

The maximum average connectivity among all orientations of a graph ⋮ Average connectivity and average edge-connectivity in graphs ⋮ Coefficient of domination in 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 ⋮ Connectivity of Cartesian products of graphs ⋮ The average connectivity of a digraph

Cites Work

• A classification scheme for vulnerability and reliability parameters of graphs
• The average connectivity of a graph

This page was built for publication: Bounds on the average connectivity of a graph