Counterexamples to a Conjecture on Laplacian Ratios of Trees
Combinatorics
2026-05-15 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2605.14176,
title = {Counterexamples to a Conjecture on Laplacian Ratios of Trees},
author = {Priyanshu Pant},
journal= {arXiv preprint arXiv:2605.14176},
year = {2026}
}