![Sample our Physical Sciences journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/110819/TOC-Subject-Sample-2021-Physical-Sciences.jpg"})
Abstract
Because of the numerous applications to mathematical chemistry and statistical physics, the number of matchings of a molecular graph has been studied extensively not only by mathematicians but also by physicists and chemists. In this paper, we consider the problem on enumeration of matchings of the silicate molecular graphs and derive the exact formula of the number of matchings of two classes of silicate molecular graphs. Particularly, we show that these two classes of silicate molecular graphs have the same matching entropy.
Acknowledgment
We are grateful to the anonymous referees for many friendly and helpful revising suggestions that greatly improved the presentation of the paper.
Disclosure statement
No potential conflict of interest was reported by the authors.
Additional information
Funding
The second author was supported in part by NSFC Grant (12071180; 11571139). The third author was supported in part by NSFC Grant (11701324) and the Program for Outstanding Young Scientific Research Talents in Fujian Province University.