Disproof of a conjecture on the minimum Wiener index of signed trees

DOI10.1016/J.AMC.2022.127577MaRDI QIDQ6041496zbMATH OpenOpenAlexWikidataFDO

Authors Songlin Guo, Wei Wang, Chuanming Wang

Publication date 31 May 2023

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.01984

zbMATH Keywords

signed graphsigned treeWiener index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Signed and weighted graphs (05C22)

Abstract: The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math. Comput., 416(2022)126755] recently introduced the Wiener index for a signed graph and conjectured that the path $P_n$ with alternating signs has the minimum Wiener index among all signed trees with $n$ vertices. By constructing an infinite family of counterexamples, we prove that the conjecture is false whenever $n$ is at least 30.

Recommendations

• On the two conjectures of the Wiener index
• The Wiener index of signed graphs
• Note on the Product of Wiener and Harary Indices
• On the Wiener index of orientations of graphs
• Counterexamples to the conjecture on orientations of graphs with minimum Wiener index

Cites work

• Distance in graphs
• The Wiener index of signed graphs
• Wiener index of trees: Theory and applications

Cited in

(3)

• General Randić indices of a graph and its line graph
• Note on the Product of Wiener and Harary Indices
• On saturated non-covered graphs

This page was built for publication: Disproof of a conjecture on the minimum Wiener index of signed trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041496)