Ilić and Ilić's minimum Laplacian-coefficient conjecture for unicyclic graphs
Let be the set of -vertex unicyclic graphs with leaves, and let be the balanced starlike unicyclic graph of order , with leaves and girth , obtained with attachment parameter . For graphs on vertices, write when every Laplacian coefficient of is at most the corresponding coefficient of .
Ilić and Ilić's conjecture. Among all -vertex unicyclic graphs, the graph has the minimum Laplacian coefficients , ; equivalently, is the only minimal element in the poset .
The conjecture concerns the simultaneous minimization of all Laplacian coefficients within unicyclic graphs with a fixed number of leaves.
References
Status
- Refuted: Jie Zhang and Xiao-Dong Zhang. Laplacian coefficients of unicyclic graphs with the number of leaves and girth (arXiv, 2013) https://arxiv.org/abs/1311.1987
Source: Jie Zhang and Xiao-Dong Zhang, “Laplacian coefficients of unicyclic graphs with the number of leaves and girth”, arXiv:1311.1987 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.