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

From MaRDI portal
Revision as of 05:49, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision β†’ (diff)

Publication:5858163

DOI10.1142/S1793830920500548zbMATH Open1457.05023arXiv2001.02857MaRDI QIDQ5858163FDOQ5858163

Xiao-Dong Zhang, Peter Luo, Cun-Quan Zhang

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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 mathcalUn,r the set of unicyclic graphs with n vertices and r vertices of even degree. In this paper we present a structural result on the graphs in mathcalUn,r with minimum Wiener index and completely characterize such graphs when rleqfracn+32.


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





Cites Work


Cited In (2)


Recommendations





This page was built for publication: Wiener index of unicycle graphs with given number of even degree vertices

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