Hansen's maximum eccentric connectivity index conjecture for graphs with fixed order and size
Statement
Let be a connected graph of order with edges, where
Define
For , let be the graph constructed from a path by joining every vertex of a clique to and , and joining vertices of the clique to .
Hansen's conjecture. The eccentric connectivity index of satisfies
with equality if and only if , or , , and is constructed from the path by joining vertices of a clique to and the remaining vertices of to .
This conjecture concerns the extremal eccentric connectivity index among connected graphs with fixed order and size. The paper presents it as an open question and attributes the conjecture to Hansen; its resolution is not established 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.