Funder
National Natural Science Foundation of China (CN)
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Dong, F.M., Hendy, M.D., Teo, K.L., Little, C.H.C.: The vertex-cover polynomial of a graph. Discret. Math. 250(1–3), 71–78 (2002). doi: 10.1016/S0012-365X(01)00272-2
2. Gutman, I.: Some analytical properties of the independence and matching polynomials. In: MATCH Communications in Mathematical and in Computer Chemistry 1.28, pp. 139–150 (1992) URL: http://match.pmf.kg.ac.rs/electronic_versions/Match28/match28_139-150.pdf
3. Gutman, I., Harary, F.: Generalizations of the matching polynomial. Utilitas Math. 24.1, 97–106 (1983)
4. Heilmann, O.J., Lieb, E.H.: Theory of monomer-dimer systems. Commun. Math. Phys. 25(3), 190–232 (1972). doi: 10.1007/BF01877590
5. Hoede, C., Li, X.: Clique polynomials and independent set polynomials of graphs. Discret. Math. 125, 219–228 (1994). doi: 10.1016/0012-365X(94)90163-5
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Independence Polynomials of Bipartite Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-06-09