亏量为一的树的三个结论(英文)  

Three Notes on Trees with Deficiency One

作　　者：刘岩[1] 

机构地区：[1]华南师范大学数学科学学院,广州510631

出　　处：《运筹学学报》2008年第4期43-47,共5页Operations Research Transactions

基　　金：supported by the Ph.D.Programs Foundation of Ministry of Education of China (No.20070574006);the NNSF(10201019) of China.

摘　　要：一个图的亏量是指不能被某个最大匹配所覆盖的顶点数.本文通过三个结论刻画了亏量为一的树.The deficiency of a graph G is the number of vertices which are missed by a maximum matching of G. In this paper, we give three results to characterize the trees with deficiency one.

关 键 词：运筹学 树 亏量 Gallai-Edmonds划分 

分 类 号：O174.52[理学—数学] O157.5[理学—基础数学]