Wiener index of unicycle graphs with given number of even degree vertices

preprint2020arXivOpen access

Abstract

The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitting experimental data for several properties of alkane compounds. Denote by Un,r\mathcal{U}_{n,r} the set of unicyclic graphs with nn vertices and rr vertices of even degree. In this paper we present a structural result on the graphs in Un,r\mathcal{U}_{n,r} with minimum Wiener index and completely characterize such graphs when r≤n+32 r\leq \frac{n+3}{2}.

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.