ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and let wSz(G)wSz(G) denote its weighted Szeged index. Tree attainment conjecture. The minimum weighted Szeged index among nn-vertex graphs is attained by a tree. This would reduce the problem of characterizing minimum weighted Szeged index graphs to the study of trees; the paper presents computational evidence and structural results for minimum weighted Szeged index trees, but does not resolve 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 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.