Trinajstić's regularity conjecture for zero index
Statement
Let denote the Trinajstić index of a graph . The conjecture concerns graphs attaining its minimum value.
Trinajstić regularity conjecture. The minimum value of the Trinajstić index is , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.