Contents

-

A Novel Characterization of n-Extendable Bipartite Graphs

Hong Lin1, Xiaofeng Guo2
1School of Sciences, Jimei University, Xiamen 361021, P. R. China
2School of Mathematical Sciences, Xiamen University, Xiamen 361005, P. R. China

Abstract

Let G be a simple connected graph. For a subset S of V(G) with |S|=2n+1, let α(2n+1)(G,S) denote the graph obtained from G by contracting S to a single vertex. The graph α(2n+1)(G,S) is also said to be obtained from G by an α(2n+1)-contraction. For pairwise disjoint subsets S1,S2,,S2n of V(G), let βn(G,S1,S2,,S2n) denote the graph obtained from G by contracting each Si (i=1,2,,2n) to a single vertex respectively. The graph β2n(G,S1,S2,,S2n) is also said to be obtained from G by a β2n-contraction. In the present paper, based on α(2n+1)-contraction and β2-contraction, some new characterizations for n-extendable bipartite graphs are given.