The connectivity and minimum degree of circuit graphs of matroids |
| |
| Authors: | Ping Li Gui Zhen Liu |
| |
| Institution: | 1. School of Mathematics and System Sciences, Shandong University, Ji’nan, 250100, P. R. China
|
| |
| Abstract: | Let G be the circuit graph of any connected matroid M with minimum degree δ(G). It is proved that its connectivity κ(G) ≥ 2|E(M) − B(M)| − 2. Therefore δ(G) ≥ 2|E(M) − B(M)| − 2 and this bound is the best possible in some sense. |
| |
| Keywords: | matroid circuit graph of matroid connectivity |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
