2012/03/05 by R. A. Bailey, Robert F. Bailey, Mike Newman +4
Computer Science · Mathematics · #05B35 #05C05 #68M10 #90B25 #Advanced Graph Theory Research #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #Interconnection Networks and Systems #math.CO #msc:05B35 #msc:05C05 #msc:68M10 #msc:90B25
paper · pdf · doi:10.48550/arxiv.1203.1014
15 pages, 5 figures. Supersedes arXiv:1012.2478
openalex publication_date 2012/03/05 · arxiv created 2014/02/07 · arxiv updated 2014/02/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide descriptions of such graphs and matroids, showing that such a graph (or matroid) has a unique decomposition. In the case of graphs, our results are relevant for certain communication protocols.