加载中…
For a graph with no isolated vertices, its Laplacian ratio is defined as where is the Laplacian matrix of , is the degree of , and denotes the permanent. Brualdi and Goldwasser asked for the maximum value of among trees with a fixed number of vertices. Wu, Dong and Lai recently proposed a conjectural answer to this problem. We give infinite families of counterexamples to their conjecture.

生成讲解博客的中文版本

生成AI智能校验的中文版本