The extreme set condition of a graph
- 点击量:
- 作者：Wang S
- 所属单位：数理与信息工程学院
- 文献类型：期刊
- 发表时间：2003-01-01
- 发表刊物：Discrete Mathematics
- 卷号：Vol.260
- 期号：NO.1
- 页面范围：151-161
- Issn号：0012-365X
- 是否译文：否
- 关键字：Extreme;set;Barrier;Deficiency;Independent;set;Matching
- 摘要：Let G be a simple graph. The size of any largest matching in G is called the matching number of G and is denoted by ν(G). Define the deficiency of , by the equation def(G)=|V(G)|−2ν(G). A set of points X in G is called an extreme set if def(G−X)=def(G)+|
推荐此文
