On the n-vertex trees with sixth to fifteenth maximum harmonic indices

Akbar Ali; Selvaraj Balachandran; Suresh Elumalai; Toufik Mansour

doi:10.1007/s13370-019-00758-0

On the n-vertex trees with sixth to fifteenth maximum harmonic indices

Akbar Ali
, Selvaraj Balachandran
, Suresh Elumalai
, Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The harmonic index of a graph G is denoted by H(G) and is defined as H(G)=∑uv∈E(G)2du+dv, where d_u, d_v denote the degrees of the vertices u, v, respectively, of G and E(G) is the edge set of G. In this paper, the graphs having sixth to fifteenth maximum harmonic indices are characterized from the class of all n-vertex trees for sufficiently large n.

Original language	English
Pages (from-to)	771-780
Number of pages	10
Journal	Afrika Matematika
Volume	31
Issue number	5-6
DOIs	https://doi.org/10.1007/s13370-019-00758-0
State	Published - 1 Sep 2020

Bibliographical note

Publisher Copyright:
© 2019, African Mathematical Union and Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature.

Keywords

Extremal problem
Harmonic index
Trees

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/s13370-019-00758-0

Cite this

@article{8dbfd9ca401e4ff5b0fc79f9a201291d,

title = "On the n-vertex trees with sixth to fifteenth maximum harmonic indices",

abstract = "The harmonic index of a graph G is denoted by H(G) and is defined as H(G)=∑uv∈E(G)2du+dv, where du, dv denote the degrees of the vertices u, v, respectively, of G and E(G) is the edge set of G. In this paper, the graphs having sixth to fifteenth maximum harmonic indices are characterized from the class of all n-vertex trees for sufficiently large n.",

keywords = "Extremal problem, Harmonic index, Trees",

author = "Akbar Ali and Selvaraj Balachandran and Suresh Elumalai and Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2019, African Mathematical Union and Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature.",

year = "2020",

month = sep,

day = "1",

doi = "10.1007/s13370-019-00758-0",

language = "English",

volume = "31",

pages = "771--780",

journal = "Afrika Matematika",

issn = "1012-9405",

publisher = "Springer Science + Business Media",

number = "5-6",

}

TY - JOUR

T1 - On the n-vertex trees with sixth to fifteenth maximum harmonic indices

AU - Ali, Akbar

AU - Balachandran, Selvaraj

AU - Elumalai, Suresh

AU - Mansour, Toufik

PY - 2020/9/1

Y1 - 2020/9/1

N2 - The harmonic index of a graph G is denoted by H(G) and is defined as H(G)=∑uv∈E(G)2du+dv, where du, dv denote the degrees of the vertices u, v, respectively, of G and E(G) is the edge set of G. In this paper, the graphs having sixth to fifteenth maximum harmonic indices are characterized from the class of all n-vertex trees for sufficiently large n.

AB - The harmonic index of a graph G is denoted by H(G) and is defined as H(G)=∑uv∈E(G)2du+dv, where du, dv denote the degrees of the vertices u, v, respectively, of G and E(G) is the edge set of G. In this paper, the graphs having sixth to fifteenth maximum harmonic indices are characterized from the class of all n-vertex trees for sufficiently large n.

KW - Extremal problem

KW - Harmonic index

KW - Trees

UR - https://www.scopus.com/pages/publications/85076514724

U2 - 10.1007/s13370-019-00758-0

DO - 10.1007/s13370-019-00758-0

M3 - Article

AN - SCOPUS:85076514724

SN - 1012-9405

VL - 31

SP - 771

EP - 780

JO - Afrika Matematika

JF - Afrika Matematika

IS - 5-6

ER -

On the n-vertex trees with sixth to fifteenth maximum harmonic indices

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this