Minimal Harary index of unicyclic graphs with diameter at most 4

Lihua Feng, Ziyuan Li, Weijun Liu, Lu Lu and Dragan Stevanović

Applied Mathematics and Computation, 2020, vol. 381, issue C

Abstract: The Harary index of a graph G is defined as H(G)=∑{u,v}⊆V(G)1dG(u,v), where dG(u, v) is the distance between the vertices u and v. In this paper, we respectively determine the minimal Harary index among all unicyclic graphs with diameter 3 and all unicyclic graphs with diameter 4.

Keywords: Unicyclic graphs; Harary index; Extremal graph (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320302812
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:381:y:2020:i:c:s0096300320302812

DOI: 10.1016/j.amc.2020.125315

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().