Minimum spectral radius conjecture for graphs with odd order and prescribed domination number
Let be odd, and let denote the class of graphs on vertices with domination number . Let be the tree obtained from by subdividing once a pendant edge on its diameter, and write as in the conjecture. Here denotes the spectral radius of a graph .
Minimum spectral radius conjecture. For every graph ,
and equality holds if and only if .
The preceding even-order result identifies the minimizer as . The odd-order analogue is presented as not easy to prove, and no resolution is supplied in the given text.
References
- Chang Liu and Jianping Li, “The minimum spectral radius of graphs with a given domination number”, arXiv:2212.01017 (2022).
Progress summary
Never refreshed
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.