Results 51 to 60 of about 4,394,235 (151)

Computing First General Zagreb Index of Operations on Graphs

open access: yesIEEE Access, 2019
The numerical coding of the molecular structures on the bases of topological indices plays an important role in the subject of Cheminformatics which is a combination of Computer, Chemistry, and Information Science. In 1972, it was shown that the total $\
Jia-bao Liu   +3 more
semanticscholar   +1 more source

Hyper Zagreb Index of Bridge and Chain Graphs

open access: yesOpen Journal of Mathematical Sciences, 2018
Let G be a simple connected molecular graph with vertex set $V(G)$ and edge set $E(G)$. One important modification of classical Zagreb index, called hyper Zagreb index $HM(G)$ is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms $[{d_G}(u)+{d_G}(v)]^2$ over all the edges of $G$, where ${d_G}(u)$ denote ...
openaire   +2 more sources

On hyper-Zagreb index and coindex

open access: yes, 2017
Bulletin t. 150 de l'Académie serbe des sciences et des arts. Classe des sciences mathématiques et naturelles. Sciences mathematiques no 42.
openaire   +2 more sources

Extremal hyper-Zagreb index of trees of given segments with applications to regression modeling in QSPR studies

open access: yesAlexandria Engineering Journal, 2023
S. Hayat   +4 more
semanticscholar   +1 more source

Reduced First Zagreb Index, Reduced Second Zagreb Index And Hyper-Zagreb Index Of Four New Sums Based On Tensor Product Of Graphs

open access: yes, 2018
Topological indices have opened up doors for better studies in structural chemistry and biology. In this paper, we compute the Reduced first Zagreb index, Reduced second Zagreb index and hyper-Zagreb index of four new graph operations based on tensor product.
openaire   +1 more source

On a Conjecture Concerning the Complementary Second Zagreb Index

open access: yesMatch Communications in Mathematical and in Computer Chemistry
The complementary second Zagreb index of a graph $G$ is defined as $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$, where $d_u(G)$ denotes the degree of a vertex $u$ in $G$ and $E(G)$ represents the edge set of $G$. Let $G^*$ be a graph having the maximum value of $cM_2$ among all connected graphs of order $n$. Furtula and Oz [MATCH Commun.
Saber, Hicham   +4 more
openaire   +3 more sources

Zagreb indices of hyper carbon nanotube graphs. [PDF]

open access: yesDiscov Nano
Shabbir A   +4 more
europepmc   +1 more source

Sharp bounds for the first Zagreb index and first Zagreb coindex [PDF]

open access: yesMiskolc Mathematical Notes, 2015
Milovanovic, Emina, Milovanovic, Igor
openaire   +2 more sources

Home - About - Disclaimer - Privacy