References
- I. Gutman, and O.E. Polansky, Mathematical Concepts in Organic Chemistry (Berlin: Springer-Verlage, 1986).
- M. Dehmer, F. Emmert-Streib, B. Hu, Y. Shi, M. Stefu, and S. Tripathi, “Highly Unique Network Descriptors Based on the Roots of the Permanental Polynomial,” Information Sciences 408 (2017): 176–81.
- W. T. Tutte, “Graph Polynomials,” Advances in applied Mathematics 32 (2004): 5.
- T. Wu, and H. Lai, “On the Permanental Nullity and Matching Number of Graphs,” Linear and Multilinear Algebra 66, no. 3 (2018): 516–24.
- G. Yu, and H. Qu, “The Coefficients of the Permanantal Polynomial,” Journal of Applied Mathematics and Computing 339 (2018): 38–44.
- R. Merris, K. R. Rebman, and W. Watkins, “Permanental Polynomials of Graphs,” Linear Algebra and Its Applications 38 (1981): 273–88.
- D. Kasum, N. Trinajstić, and I. Gutman, “Chemical Graph Theory.III. On Permanental Polynomial,”Croat. Chem. Acta 54, no. 3 (1981): 321–8.
- T. Wu, and H. Lai, “On the Permanental Sum of Graphs,” Journal of Applied Mathematics and Computing 331 (2018): 334–40.
- H. Tong, “Parallel Algorithms for Computing Permanents and Permanental Polynomials of Sparse Matrices” (PhD thesis, Tsinghua University, 2006).
- T. Wu, S. Ren, and K. Das, “Some Extremal Graphs with Respect to Permanental Sum,” Bulletin of the Malaysian Mathematical Sciences Society 42, no. 6 (2019): 2947–61.
- W. Li, Z. Qin, and H. Zhang, “Extremal Hexagonal Chains with Respect to the Coefficients Sum of the Permanental Polynomials of Graphs,” Journal of Applied Mathematics and Computing 291 (2016): 30–8.
- S. Li, and W. Wei, “Extremal Octagonal Chains with Respect to the Coefficients Sum of the Permanental Polynomial,” Journal of Applied Mathematics and Computing 328, no. 1 (2018): 45–57.
- H. Zhao, and X. Li, “On the Fibonacci Numbers of Trees,” Fibonacci Quart 44, no. 1 (2006): 32–16.