CONSTRUCTION CHARACTERIZATIONS FOR DEFECT n-EXTENDABLE BIPARTITE GRAPHS

被引：0
|
作者：
Wen, Xuelian [1 ]
Yang, Zihui [2 ]
Zhang, Zan-Bo [3 ]
机构：
[1] South China Normal Univ, Sch Econ & Management, Guangzhou 510006, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Lingnan Coll, Guangzhou 510275, Guangdong, Peoples R China
[3] Guangdong Ind Tech Coll, Dept Comp Engn, Guangzhou 510300, Guangdong, Peoples R China
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2009年 / 6卷 / 03期
关键词：
Near perfect matching; defect n-extendable; minimal defect n-extendable graph;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A near perfect matching is a matching covering all but one vertex in a graph. Let G be a connected graph and n <= (vertical bar V(G)vertical bar-2)/2 be a positive integer. If any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. This paper presents two construction characterizations of defect n-extendable bipartite graphs and a necessary condition for minimal defect n-extendable bipartite graphs.
引用
收藏
页码：353 / 360
页数：8
相关论文
共 50 条
  • [1] On defect n-extendable bipartite graphs
    Wen, Xuelian
    IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2347 - 2352
  • [2] Characterizing defect n-extendable bipartite graphs with different connectivities
    Wen, Xuelian
    Lou, Dingjun
    DISCRETE MATHEMATICS, 2007, 307 (15) : 1898 - 1908
  • [3] Minimum degree of minimal defect n-extendable bipartite graphs
    Wen, Xuelian
    Yang, Zihui
    DISCRETE MATHEMATICS, 2009, 309 (21) : 6255 - 6264
  • [4] Hamilton Cycles in n-Extendable Bipartite Graphs
    Li, Yueping
    Lou, Dingjun
    ARS COMBINATORIA, 2018, 139 : 3 - 18
  • [5] A novel characterization of n-extendable bipartite graphs
    Lin, Hong
    Guo, Xiaofeng
    ARS COMBINATORIA, 2009, 91 : 353 - 362
  • [6] M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities
    Wen, Xuelian
    Zhang, Zan-Bo
    Lou, Dingjun
    DISCRETE MATHEMATICS, 2011, 311 (10-11) : 817 - 826
  • [7] On the structure of minimally n-extendable bipartite graphs
    Lou, DJ
    DISCRETE MATHEMATICS, 1999, 202 (1-3) : 173 - 181
  • [8] Characterizing minimally n-extendable bipartite graphs
    Lou, Dingjun
    DISCRETE MATHEMATICS, 2008, 308 (11) : 2269 - 2272
  • [9] Hamilton Paths in n-Extendable Bipartite Graphs
    Gan, Zhiyong
    Lou, Dingjun
    ARS COMBINATORIA, 2021, 154 : 3 - 21
  • [10] Long Cycles in n-Extendable Bipartite Graphs
    Gan, Zhiyong
    Lou, Dingjun
    ARS COMBINATORIA, 2019, 144 : 91 - 106
12345