The average connectivity of a graph

DOI10.1016/S0012-365X(01)00180-7zbMATH Open1002.05040OpenAlexW2048460015MaRDI QIDQ1613484FDOQ1613484

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

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

zbMATH Keywords

average connectivityuniformly connected

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (35)

• The eavesdropping number of a graph
• Uniformly 3‐connected graphs
• On the average lower bondage number of a graph
• Coefficient of domination in graph
• Efficient presolving methods for the influence maximization problem
• The average connectivity of a family of expander graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Uniformly connected graphs
• Fuzzy graphs in telecommunications: exploring average fuzzy cyclic connectivity for enhanced connectivity analysis
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• Bounds on the average connectivity of a graph
• 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 average size of a connected vertex set of a graph—Explicit formulas and open problems
• The maximum average connectivity among all orientations of a graph
• Tree robustness of a graph
• On the average order of a dominating set of a forest
• Properties of uniformly \(3\)-connected graphs
• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• 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 average connectivity matrix of a graph
• The common-neighbourhood of a graph
• The path-index of a graph
• A new measure of graph connectivity
• The average lower connectivity of graphs
• Title not available (Why is that?)
• 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)