The minimum harmonic index for bicyclic graphs with given diameter
Author(s) -
Adeleh Abdolghafourian,
Mohammad Iranmanesh
Publication year - 2022
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil2201125a
Subject(s) - mathematics , bicyclic molecule , combinatorics , graph , vertex (graph theory) , topological index , harmonic , index (typography) , discrete mathematics , chemistry , physics , stereochemistry , computer science , quantum mechanics , world wide web
The harmonic index of a graph G, is defined as the sum of weights 2/d(u)+d(v) of all edges uv of G, where d(u) is the degree of the vertex u in G. In this paper we find the minimum harmonic index of bicyclic graph of order n and diameter d. We also characterized all bicyclic graphs reaching the minimum bound.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom