바로가기메뉴

본문 바로가기 주메뉴 바로가기
 

logo

  • P-ISSN3059-0604
  • E-ISSN3059-1309
  • KCI

ISSN : 3059-0604

Article Contents

Prev Next
e-Submission

Vol.26 No.3

PDF Citation Share

EXTREMAL CHEMICAL TREES WITH RESPECT TO HYPER-ZAGREB INDEX

Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics / Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics, (P)3059-0604; (E)3059-1309
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, 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 $HM(G)={\sum}_{uv{\in}E(G)}[deg_G(u)+deg_G(v)]^2$, where $deg_G(u)$ is the degree of a vertex u in G. In this paper, all chemical trees of order $n{\geq}12$ with the first twenty smallest hyper-Zagreb index are characterized.

keywords
extremal problems, chemical tree, hyper-Zagreb, graph operation

Journal of the Korean Society of Mathematical Education Series B: Theoretical Mathematics and Pedagogical Mathematics

e-Submission OA Policy