The Zagreb index inequality conjecture
Statement
Let be a simple connected graph with vertices and edges. Its first and second Zagreb indices are
where is the degree of vertex . Zagreb index inequality conjecture. For all such graphs,
and the bound is tight for complete graphs. The conjecture was disproved for general connected graphs, but it was proven to hold for chemical graphs; this paper also identifies classes, such as subdivision graphs, for which it holds.
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.