The deficiency of a graph G is the number of vertices unmatched under a maximum matching in G. In this paper, we present sufficient spectral conditions of a (connected) graph to be beta-deficient for the graph with given minimum degree and relatively large order.
机构:
North Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R China
North Univ China, Sch Instrument & Elect, Taiyuan 030051, Shanxi, Peoples R ChinaNorth Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R China
Sun, Xiaoling
Gao, Yubin
论文数: 0引用数: 0
h-index: 0
机构:
North Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R ChinaNorth Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R China
Gao, Yubin
Du, Jianwei
论文数: 0引用数: 0
h-index: 0
机构:
North Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R ChinaNorth Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R China
Du, Jianwei
Xu, Lan
论文数: 0引用数: 0
h-index: 0
机构:
North Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R ChinaNorth Univ China, Sch Sci, Taiyuan 030051, Shanxi, Peoples R China