Extensions of barrier sets to nonzero roots of the matching polynomial

被引：8

作者：

Ku, Cheng Yeaw ^{[1
]}

Wong, Kok Bin ^{[2
]}

机构：

[1] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore

[2] Univ Malaya, Inst Math Sci, Kuala Lumpur 50603, Malaysia

来源：

DISCRETE MATHEMATICS | 2010年 / 310卷 / 24期

关键词：

Matching polynomial; Gallai-Edmonds decomposition; Barrier sets; Extreme sets;

D O I：

10.1016/j.disc.2010.09.002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to their connection to maximum matchings in a graph. For a root theta of the matching polynomial, we define theta-barrier and theta-extreme sets. We prove a generalized Berge-Tutte formula and give a characterization for the set of all theta-special vertices in a graph. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：3544 / 3550

页数：7

共 23 条

[21] Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
Jin, Ya-Lei
Yeh, Yeong-Nan
Zhang, Xiao-Dong
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (03) : 1345 - 1372
[22] Matching polynomial coefficients and the Hosoya indices of poly(p-phenylene) graphs
Ghosh, Tapanendu
Mondal, Sukanya
Mandal, Bholanath
MOLECULAR PHYSICS, 2018, 116 (03) : 361 - 377
[23] Fully localized a posteriori error estimators and barrier sets for contact problems
Nochetto, RH
Siebert, KG
Veeser, A
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2005, 42 (05) : 2118 - 2135

← 1 2 3 →