ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NT(G)NT(G) denote the Trinajstić index of a graph GG. The conjecture concerns graphs attaining its minimum value.

Trinajstić regularity conjecture. The minimum value of the Trinajstić index is 00, and being regular is a necessary but not sufficient condition for a graph to attain this minimum.

The paper states that this conjecture is false and presents a class of nonregular graphs with zero Trinajstić index. Thus, regularity is not necessary for attaining the minimum.

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.