Extremal Harary Index of Graphs with Given Number of Vertices of Odd Degree

Zhenhua Su, Zikai Tang, Hanyuan Deng and Meabed Khader

Mathematical Problems in Engineering, 2022, vol. 2022, 1-4

Abstract: The Harary index is one of the most investigated topological indices in mathematical chemistry and in related disciplines, which can be used to describe the molecular structure and physical properties. Let Gn,2k be the set of all connected graphs on n vertices with exactly 2k vertices of odd degree. Recently, the graphs in Gn,0 with the first four maximal Harary index and the first minimal Harary index are determined. In the paper, by using the edge-deleted method and some combinatorial skills, we characterize the graph in Gn,2k with the maximal Harary index for all 0≤k≤n/2, the graphs in Gn,2 with the first two minimal Harary index, and the graph in Gn,4 with the minimal Harary index. These results will be conducive to the further study of Harary index and its applications.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/4916308.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/4916308.xml (application/xml)

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:hin:jnlmpe:4916308

DOI: 10.1155/2022/4916308

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().