The Connectivity and Minimum Degree of Circuit Graphs of Matroids  

作　　者：Ping LI Gui Zhen LIU 

机构地区：[1]ematics and System Sciences, Shandong University, Ji'nan 250100, P. R. China [2]School of Mathematics and System Sciences, Shandong University, Ji'nan 250100, P. R. China

出　　处：《Acta Mathematica Sinica,English Series》2010年第2期353-360,共8页数学学报（英文版）

基　　金：Supported by National Natural Science Foundation of China (Grant No. 60673047) and RFDP 200804220001

摘　　要：Let G be the circuit graph of any connected matroid M with minimum degree 5（G）. It is proved that its connectivity κ（G） ≥2｜E（M） - B（M）｜ - 2. Therefore 5（G） ≥ 2｜E（M） - B（M）｜ - 2 and this bound is the best possible in some sense.Let G be the circuit graph of any connected matroid M with minimum degree 5（G）. It is proved that its connectivity κ（G） ≥2｜E（M） - B（M）｜ - 2. Therefore 5（G） ≥ 2｜E（M） - B（M）｜ - 2 and this bound is the best possible in some sense.

关 键 词：MATROID circuit graph of matroid CONNECTIVITY 

分 类 号：O157.5[理学—数学] U472.4[理学—基础数学]