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

DOI10.1016/J.AMC.2022.127577arXiv2208.01984OpenAlexW4306369290WikidataQ123143546 ScholiaQ123143546MaRDI QIDQ6041496FDOQ6041496

Authors: Songlin Guo, Wei Wang, Chuanming Wang 

Publication date: 31 May 2023

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

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.

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

zbMATH Keywords

signed graphWiener indexsigned tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• General Randić indices of a graph and its line graph

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)