ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple connected graph with nn vertices, and let irr⁡t(G)\operatorname{irr}_{t}(G) denote its total irregularity. A graph is regular if all its vertices have the same degree. Second-minimal total irregularity conjecture. If GG is not a regular graph, then

irr⁡t(G)≥2n−4.\operatorname{irr}_{t}(G)\geq 2n-4.

The paper identifies 00 as the minimal total irregularity, attained by regular graphs, and proposes 2n−42n-4 as the second-minimal value for simple connected graphs on nn 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.