Réti et al.'s maximum Sombor index conjecture for connected cyclic graphs
Statement
Let and be fixed integers with
Let be the graph constructed from the star by adding edges between a fixed pendent vertex and other pendent vertices. The Sombor index of a graph is
Réti et al.'s conjecture. Among all connected -cyclic graphs of order , only the graph has the maximum Sombor index.
The conjecture identifies the unique extremal graph for the Sombor index in this class. It is proved in Section 3 of the source paper.
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.