Conjecture that fewer graphs lie in A than in B
Statement
Let be the set of graphs of order . For a graph with vertices and edges, let and denote its first and second Zagreb indices, respectively. Define
The – cardinality conjecture. .
The paper presents this as a relevant conjecture after proving that, for , the class of graphs satisfying has greater cardinality than both and . The conjecture itself is not resolved in the supplied text.
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.