EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX
Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics / Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, (P)1226-0657; (E)2287-6081
2019, v.26 no.3, pp.177-188
https://doi.org/10.7468/jksmeb.2019.26.3.177
Ghalavand, Ali
Ashrafi, Ali Reza
Sharafdini, Reza
Ori, Ottorino
Ghalavand,,
A.
, Ashrafi,,
A.
R.
, Sharafdini,,
R.
, &
Ori,,
O.
(2019). EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX. Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, 26(3), 177-188, https://doi.org/10.7468/jksmeb.2019.26.3.177
Abstract
Suppose G is a molecular graph with edge set E(G). The hyper-Zagreb index of G is defined as <TEX>$HM(G)={\sum}_{uv{\in}E(G)}[deg_G(u)+deg_G(v)</TEX><TEX>]</TEX><TEX>^2$</TEX>, where <TEX>$deg_G(u)$</TEX> is the degree of a vertex u in G. In this paper, all chemical trees of order <TEX>$n{\geq}12$</TEX> with the first twenty smallest hyper-Zagreb index are characterized.
- keywords
-
extremal problems,
chemical tree,
hyper-Zagreb,
graph operation