Date of Publication:2003-01-01 Hits:
First Author:Wang S
Date of Publication:2003-01-01
Journal:Discrete Mathematics
Affiliation of Author(s):数理与信息工程学院
Document Type:期刊
Volume:Vol.260
Issue:NO.1
Page Number: 151-161
ISSN No.:0012-365X
Key Words:Extreme;set;Barrier;Deficiency;Independent;set;Matching
Abstract: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)+|
Translation or Not:no