Results 11 to 20 of about 572,605 (265)

A Novel/Old Modification of the First Zagreb Index [PDF]

open access: yesMolecular Informatics, 2018
AbstractIn the seminal paper [I. Gutman, N. Trinajstić, Chem. Phys. Lett. 1972, 17, 535–538], it was shown that total electron energy ( ) of any alternant hydrocarbon depends on the sum of the squares of the degrees of the corresponding molecular graph. Nowadays, this sum is known as the first Zagreb index.
Akbar Ali, Nenad Trinajstić
semanticscholar   +7 more sources

New lower bounds for the first variable Zagreb index [PDF]

open access: greenDiscrete Applied Mathematics, 2022
17 ...
Alvaro Martínez-Pérez   +1 more
exaly   +7 more sources

First General Zagreb Co‐Index of Graphs under Operations [PDF]

open access: goldJournal of Mathematics, 2022
Topological indices are graph‐theoretic parameters which are widely used in the subject of chemistry and computer science to predict the various chemical and structural properties of the graphs respectively. Let G be a graph; then, by performing subdivision‐related operations S, Q, R, and T on G, the four new graphs S(G) (subdivision graph), Q(G) (edge‐
Muhammad Javaid   +4 more
openaire   +3 more sources

Some properties of the neighborhood first Zagreb index [PDF]

open access: greenDiscrete Mathematics Letters, 2019
Summary: The neighborhood first Zagreb index \((N M_1)\) has been recently introduced for characterizing the topological structure of molecular graphs. In this study, we present some sharp bounds on the index \(NM_1\) and establish its relations with the first and second Zagreb indices in case of some special graphs.
Tamas Reti   +3 more
doaj   +3 more sources

Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number [PDF]

open access: bronzeMatch-communications in Mathematical and in Computer Chemistry, 2023
The first Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. The repetition number of a graph is the maximum multiplicity in the list of its vertex degrees. In this note, we bound the first Zagreb index of a tree from
Hongying Lin, Jianguo Qian
semanticscholar   +2 more sources

Sharp Bounds on the Generalized Multiplicative First Zagreb Index of Graphs with Application to QSPR Modeling

open access: yesMathematics, 2023
Degree sequence measurements on graphs have attracted a lot of research interest in recent decades. Multiplying the degrees of adjacent vertices in graph Ω provides the multiplicative first Zagreb index of a graph.
Sakander Hayat, Farwa Asmat
semanticscholar   +3 more sources

First General Zagreb Index of Generalized F-sum Graphs [PDF]

open access: goldDiscrete Dynamics in Nature and Society, 2020
The first general Zagreb (FGZ) index (also known as the general zeroth-order Randić index) of a graph G can be defined as M
H. M. Awais, Muhammad Javaid, Akbar Ali
openaire   +3 more sources

On the first general Zagreb eccentricity index

open access: goldAIMS Mathematics, 2021
In a graph <i>G</i>, the distance between two vertices is the length of the shortest path between them. The maximum distance between a vertex to any other vertex is considered as the eccentricity of the vertex. In this paper, we introduce the first general Zagreb eccentricity index and found upper and lower bounds on this index in terms of ...
Muhammad Kamran Jamil   +3 more
openaire   +3 more sources

Probabilistic analysis of the First Zagreb index [PDF]

open access: yesTransactions on Combinatorics, 2013
In this paper we study the Zagreb index in bucket recursive trees containing buckets with variable capacities. This model was introduced by Kazemi in 2012.
Ramin Kazemi
doaj   +2 more sources

Bounds on the first leap Zagreb index of trees

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
The first leap Zagreb index $LM1(G)$ of a graph $G$ is the sum of the squares of its second vertex degrees, that is, $LM_1(G)=\sum_{v\in V(G)}d_2(v/G)^2$, where $d_2(v/G)$ is the number of second neighbors of $v$ in $G$.
N. Dehgardi, H. Aram
doaj   +3 more sources

Home - About - Disclaimer - Privacy