Average connectivity and average edge-connectivity in graphs
From MaRDI portal
Publication:390306
DOI10.1016/j.disc.2013.05.024zbMath1281.05086OpenAlexW2020709200MaRDI QIDQ390306
Publication date: 23 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.024
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (2)
The path-index of a graph ⋮ Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
Cites Work
- Exponentially many perfect matchings in cubic graphs
- Matching and edge-connectivity in regular graphs
- Brick decompositions and the matching rank of graphs
- Matching theory
- Bounds on the average connectivity of a graph
- The average connectivity of a graph
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Rank of maximum matchings in a graph
This page was built for publication: Average connectivity and average edge-connectivity in graphs