The first–second Zagreb index comparison conjecture
Statement
Let be a graph with vertex set , edge set , order , size , vertex degree , first Zagreb index
and second Zagreb index
Zagreb index comparison conjecture. If is a connected graph, then
The conjecture arose in the study of graph-based descriptors of molecular structure. It is disproved for both general connected and disconnected graphs, although it is true for trees.
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.