The average connectivity of a graph

DOI10.1016/S0012-365X(01)00180-7MaRDI QIDQ1613484zbMATH OpenOpenAlexFDO

Authors L. W. Beineke, Ortrud R. Oellermann, Raymond E. Pippert

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

zbMATH Keywords

average connectivityuniformly connected

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Average connectivity and average edge-connectivity in graphs
• Average edge-connectivity of a graph
• The average connectivity of a digraph
• Bounds on the average connectivity of a graph
• The average lower connectivity of graphs
• Average distance and vertex-connectivity
• scientific article; zbMATH DE number 6999760
• The average connectivity of a family of expander graphs
• The average size of a connected vertex set of a \(k\)-connected graph
• The maximum average connectivity among all orientations of a graph

Cited in

(35)

• The eavesdropping number of a graph
• On the average lower bondage number of a graph
• Uniformly 3‐connected graphs
• Coefficient of domination in graph
• The average connectivity of a family of expander graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Efficient presolving methods for the influence maximization problem
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
• Uniformly connected graphs
• Bounds on the average connectivity of a graph
• Fuzzy graphs in telecommunications: exploring average fuzzy cyclic connectivity for enhanced connectivity analysis
• The average connectivity of a digraph
• The average size of a connected vertex set of a \(k\)-connected graph
• Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
• The maximum average connectivity among all orientations of a graph
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• Tree robustness of a graph
• On the average order of a dominating set of a forest
• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• Properties of uniformly \(3\)-connected graphs
• Optimal Orientation On-Line
• On average connectivity of the strong product of graphs
• Asymptotic connectivity of hyperbolic planar graphs
• Tree-minimal graphs are almost regular
• The average lower reinforcement number of a graph
• Average distance and vertex-connectivity
• The vulnerability of some networks including cycles via domination parameters
• Asymptotic connectivity of infinite graphs
• The common-neighbourhood of a graph
• The average connectivity matrix of a graph
• The path-index of a graph
• A new measure of graph connectivity
• The average lower connectivity of graphs
• scientific article; zbMATH DE number 6999760 (Why is no real title available?)
• Average connectivity and average edge-connectivity in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613484)