ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn with mm edges, where

n−1≤m≤(n−12).n-1\leq m\leq {n-1\choose 2}.

Define

D=⌊2n+1−17+8(m−n)2⌋,k=m−(n−D+12)−D+1.D=\left\lfloor\frac{2n+1-\sqrt{17+8(m-n)}}{2}\right\rfloor,\qquad k=m-{n-D+1\choose 2}-D+1.

For n,D,kn,D,k, let En,D,kE_{n,D,k} be the graph constructed from a path u0−u1−…−uDu_0-u_1-\ldots-u_D by joining every vertex of a clique Kn−D−1K_{n-D-1} to u0u_0 and u1u_1, and joining kk vertices of the clique to u2u_2.

Hansen's conjecture. The eccentric connectivity index of GG satisfies

ξc(G)≤ξc(En,D,k),\xi^c(G)\leq \xi^c(E_{n,D,k}),

with equality if and only if G≃En,D,kG\simeq E_{n,D,k}, or D=3D=3, k=n−4k=n-4, and GG is constructed from the path u0−u1−u2−u3u_0-u_1-u_2-u_3 by joining 1≤i≤n−31\leq i\leq n-3 vertices of a clique Kn−4K_{n-4} to u0,u1,u2u_0,u_1,u_2 and the remaining n−4−in-4-i vertices of Kn−4K_{n-4} to u1,u2,u3u_1,u_2,u_3.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.