| 障碍拟阵图 |
| |
| 引用本文： | 王世英,殷志祥.障碍拟阵图[J].东北数学,2003,19(1):19-25. |
| |
| 作者姓名： | 王世英 殷志祥 |
| |
| 作者单位： | Department of Mathematics，Shanxi University，Taiyuan，030006，Department of Mathematics and Physics，Huainan Institute of Technology，Huainan，Anhui，232001 |
| |
| 摘 要： | Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.
|
| 关 键 词： | 障碍拟阵图 简单图 双临界图 障碍集 子图 |
Extreme Matroid Graphs |
| |
| WANG Shiying.Extreme Matroid Graphs[J].Northeastern Mathematical Journal,2003,19(1):19-25. |
| |
| Authors: | WANG Shiying |
| |
| Institution: | [1]DeprtmentofMathematics,ShanxiUniversity,Taiyuan,030006 [2]DepartmentofMathematicsandPhysics,HuainanInstituteofTechnology,Huaninan,Anhui,232001 |
| |
| Abstract: | Let G be a simple graph and I={S:S is extreme in G},If M(V(G),I) is a matroid ,then G is called an extreme matroid graph,In this paper,we study the properties of extreme matroid graph. |
| |
| Keywords: | extreme matroid graph extreme set bicritical graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
