Note: Paths in circuit graphs of matroids

Authors:
Guizhen Liu;Ping Li
Affiliations:
School of Mathematics and System Sciences, Shandong University, Jinan 250100, PR China;School of Mathematics and System Sciences, Shandong University, Jinan 250100, PR China
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 0

A lower bound on connectivities of matroid base graphs

Discrete Mathematics
The connectivity of the basis graph of a branching greedoid

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications
Cycles in Circuit Graphs of Matroids

Graphs and Combinatorics
The Edge Connectivity of Circuit Graphs of Matroids

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let G be the circuit graph of any connected matroid. It is proved that for any two vertices of G, there is a path of length k joining them for any integer k satisfying 2@?k@?|V(G)|-1.