Counterexamples to a Conjecture on Laplacian Ratios of Trees
Abstract
For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ π(G)=per(L(G))Πv∈ V(G) d(v), \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and \(per\) denotes the permanent. Brualdi and Goldwasser asked for the maximum value of \(π(T)\) among trees \(T\) 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.