2 papers
math.CO2024
Solution to an open problem on Laplacian ratio
T. Wu
Let G be a graph. The Laplacian ratio of G is the permanent of the Laplacian matrix of G divided by the product of degrees of all vertices. The computational complexity of Laplacia…
math.CO2023
Enumeration of maximum matchings of graphs
Tingzeng Wu, Xiaolin Zeng, Huazhong Lv
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. Howe…