1 paper · 1 filter
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…