EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX
EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX
한국수학교육학회지시리즈B:순수및응용수학 / 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
(Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan)
Ashrafi, Ali Reza
(Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan)
Sharafdini, Reza
(Department of Mathematics, Faculty of Science, Persian Gulf University)
Ori, Ottorino
(Actinum Chemical Research)
Ghalavand, Ali,
Ashrafi, Ali Reza,
Sharafdini, Reza,
&
Ori, Ottorino.
(2019). EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX. 한국수학교육학회지시리즈B:순수및응용수학, 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