The complete multipartite extremal conjecture for the maximum ABC index
Statement
Let be an -vertex connected graph with chromatic number . Let denote the complete -partite graph of order whose part sizes differ by at most one. The quantity denotes the atom-bond connectivity index.
The complete multipartite extremal conjecture.
with equality if and only if .
This conjecture proposes that, among connected graphs with fixed order and chromatic number at least , the balanced complete multipartite graph maximizes the ABC index. The supplied text gives no resolution of the conjecture.
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.