The Edge Connectivity of Circuit Graphs of Matroids

Authors:
Ping Li;Guizhen Liu
Affiliations:
Department of Mathematics, Shandong University, Jinan 250100, P.R. China;Department of Mathematics, Shandong University, Jinan 250100, P.R. China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 2
Cited 1

A lower bound on connectivities of matroid base graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Note: Paths in circuit graphs of matroids

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be the circuit graph of any connected matroid and let 驴驴(G) and 驴(G) be the edge connectivity and minimum degree of G. It is proved that 驴驴(G) = 驴(G).