Extremal Bicyclic Graph with Perfect Matching for Different Indices
Bulletin of the Malaysian Mathematical Society, Tome 36 (2013) no. 3
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
Let $\mathscr{B}(2m,m)$ be the set of all bicyclic graphs on $2m(m\geq 2)$ vertices with perfect matchings. In this paper, we characterize the bicyclic graphs with minimal number of matchings and maximal number of independent sets in $\mathscr{B}(2m,m)$.
Classification :
49M15, 65K10
@article{BMMS_2013_36_3_a16,
author = {Shan Duan and Zhongxun Zhu},
title = {Extremal {Bicyclic} {Graph} with {Perfect} {Matching} for {Different} {Indices}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2013},
volume = {36},
number = {3},
url = {http://geodesic.mathdoc.fr/item/BMMS_2013_36_3_a16/}
}
Shan Duan; Zhongxun Zhu. Extremal Bicyclic Graph with Perfect Matching for Different Indices. Bulletin of the Malaysian Mathematical Society, Tome 36 (2013) no. 3. http://geodesic.mathdoc.fr/item/BMMS_2013_36_3_a16/