2016
DOI: 10.14317/jami.2016.479
|View full text |Cite
|
Sign up to set email alerts
|

Edge Version of Harmonic Index and Harmonic Polynomial of Some Classes of Graphs

Abstract: In this paper we define the edge version of harmonic index and harmonic polynomial of a graph G. We computed explicit formulas for the edge version of harmonic index and harmonic polynomial of many well known classes of graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…x d u +d v −1 , and the harmonic polynomials of some graphs are computed. The harmonic polynomials of the line of some graphs are computed in reference [21]. This polynomial owes its name to the fact that 2 1 0 H(G, x) dx = H(G).…”
Section: Introductionmentioning
confidence: 99%
“…x d u +d v −1 , and the harmonic polynomials of some graphs are computed. The harmonic polynomials of the line of some graphs are computed in reference [21]. This polynomial owes its name to the fact that 2 1 0 H(G, x) dx = H(G).…”
Section: Introductionmentioning
confidence: 99%
“…Several graph parameters have been used to define a graph polynomial, for instance, differential number, the parameters associated to matching, independent and domination sets, chromatic numbers and many others (see, e.g., [12] and the references therein). In recent years there have been many works on graph polynomials associated with different topological indices (see, e.g., [13][14][15][16][17]).…”
Section: Introductionmentioning
confidence: 99%
“…The harmonic polynomials of the line graphs were studied in [17]. The inverse degree polynomial is studied to understand better the inverse degree topological index.…”
Section: Introductionmentioning
confidence: 99%
“…x d u +d v −1 , and the harmonic polynomials of some graphs are computed. For more information on the study of polynomials associated with topological indices and their practical applications, see, e.g., [20][21][22][23]. This polynomial owes its name to the fact that 2 1 0 H(G, x) dx = H(G).…”
Section: Introductionmentioning
confidence: 99%