The second-minimal total irregularity conjecture for connected graphs
Statement
Let be a simple connected graph with vertices, and let denote its total irregularity. A graph is regular if all its vertices have the same degree. Second-minimal total irregularity conjecture. If is not a regular graph, then
The paper identifies as the minimal total irregularity, attained by regular graphs, and proposes as the second-minimal value for simple connected graphs on vertices. The claim is presented as an open problem for further research.
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.