Zhu–You–Yang's lower-bound conjecture for non-regular graphs
Statement
Let be a simple connected graph with vertices. A graph is non-regular if its vertices do not all have the same degree.
Zhu–You–Yang's conjecture. If is non-regular, then
This conjecture concerns the minimum total irregularity among connected non-regular graphs; the source gives no resolution, so its status remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.