Premium
Ordering the complements of trees by the number of maximum matchings
Author(s) -
Yan Weigen,
Yeh YeongNan,
Zhang Fuji
Publication year - 2005
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.20688
Subject(s) - combinatorics , mathematics , matching (statistics) , graph , set (abstract data type) , quantum , group (periodic table) , discrete mathematics , computer science , physics , quantum mechanics , statistics , programming language
A “perfect matching” of a graph G with n vertices is a set of ⌊ n /2⌋ independent edges of G . In the present study, we succeeded in determining the trees whose complements have the extremal number of “perfect matchings” for two different group of trees. Some further problems are also posed. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom