Tu, Jianhua; Zhang, Zhipeng; Shi, Yongtang The maximum number of maximum dissociation sets in trees. (English) Zbl 1521.05026 J. Graph Theory 96, No. 4, 472-489 (2021). MSC: 05C05 05C35 PDFBibTeX XMLCite \textit{J. Tu} et al., J. Graph Theory 96, No. 4, 472--489 (2021; Zbl 1521.05026) Full Text: DOI
Wan, Pengfei; Chen, Xinzhuang; Tu, Jianhua; Dehmer, Matthias; Zhang, Shenggui; Emmert-Streib, Frank On graph entropy measures based on the number of independent sets and matchings. (English) Zbl 1457.68225 Inf. Sci. 516, 491-504 (2020). MSC: 68R10 05C69 05C70 94A17 PDFBibTeX XMLCite \textit{P. Wan} et al., Inf. Sci. 516, 491--504 (2020; Zbl 1457.68225) Full Text: DOI
Wan, Pengfei; Tu, Jianhua; Dehmer, Matthias; Zhang, Shenggui; Emmert-Streib, Frank Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs. (English) Zbl 1433.05266 Appl. Math. Comput. 363, Article ID 124616, 12 p. (2019). MSC: 05C75 94A17 05C05 PDFBibTeX XMLCite \textit{P. Wan} et al., Appl. Math. Comput. 363, Article ID 124616, 12 p. (2019; Zbl 1433.05266) Full Text: DOI
Wan, Pengfei; Tu, Jianhua; Zhang, Shenggui; Li, Binlong Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. (English) Zbl 1427.05170 Appl. Math. Comput. 332, 42-47 (2018). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Wan} et al., Appl. Math. Comput. 332, 42--47 (2018; Zbl 1427.05170) Full Text: DOI