ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B2(n)B_2(n) denote the family of bicyclic graphs specified in the paper, and let G∈B2(n)G\in B_2(n) have order n≥11n\geq 11. The Graovac-Ghorbani atom-bond connectivity index is denoted by ABCGG(G)ABC_{GG}(G). B2-family minimum conjecture.

ABCGG(G)≥ABCGG(B2(3,1,n−3)).ABC_{GG}(G)\geq ABC_{GG}\bigl(B_2(3,1,n-3)\bigr).

Equality holds if and only if G≅B2(3,1,n−3)G\cong B_2(3,1,n-3). This is the proposed extremal description for the minimum index within the B2(n)B_2(n) family, for both odd and even n≥11n\geq 11.

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.