Minimum weighted Szeged index graphs are attained by trees
Statement
Let be an -vertex graph, and let denote its weighted Szeged index. Tree attainment conjecture. The minimum weighted Szeged index among -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.