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

preprint2022arXivOpen access

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 PnP_n with alternating signs has the minimum Wiener index among all signed trees with nn vertices. By constructing an infinite family of counterexamples, we prove that the conjecture is false whenever nn is at least 30.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.