scholarly journals Lower Bounds on the Entire Zagreb Indices of Trees

2020 ◽  
Vol 2020 ◽  
pp. 1-8 ◽  
Author(s):  
Liang Luo ◽  
Nasrin Dehgardi ◽  
Asfand Fahad
Keyword(s):  
Lower Bounds ◽  
Molecular Graph ◽  
Zagreb Indices ◽  
Degree Of A Vertex

For a (molecular) graph G, the first and the second entire Zagreb indices are defined by the formulas M1εG=∑x∈VG∪EGdx2 and M2εG=∑x is either adjacent or incident to ydxdy in which dx represents the degree of a vertex or an edge x. In the current manuscript, we establish some lower bounds on the first and the second entire Zagreb indices and determine the extremal trees which achieve these bounds.

scholarly journals On multiplicative degree based topological indices for planar octahedron networks

2020 ◽  
Vol 43 (1) ◽  
pp. 219-228
Author(s):  
Ghulam Dustigeer ◽  
Haidar Ali ◽  
Muhammad Imran Khan ◽  
Yu-Ming Chu
Keyword(s):  
Graph Theory ◽  
Information Science ◽  
Biological Activities ◽  
Molecular Graph ◽  
Triangular Prism ◽  
Structure Property ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Chemical Graph Theory ◽  
Analytical Formulas

AbstractChemical graph theory is a branch of graph theory in which a chemical compound is presented with a simple graph called a molecular graph. There are atomic bonds in the chemistry of the chemical atomic graph and edges. The graph is connected when there is at least one connection between its vertices. The number that describes the topology of the graph is called the topological index. Cheminformatics is a new subject which is a combination of chemistry, mathematics and information science. It studies quantitative structure-activity (QSAR) and structure-property (QSPR) relationships that are used to predict the biological activities and properties of chemical compounds. We evaluated the second multiplicative Zagreb index, first and second universal Zagreb indices, first and second hyper Zagreb indices, sum and product connectivity indices for the planar octahedron network, triangular prism network, hex planar octahedron network, and give these indices closed analytical formulas.

scholarly journals Wiener–Hosoya Matrix of Connected Graphs

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 359
Author(s):  
Hassan Ibrahim ◽  
Reza Sharafdini ◽  
Tamás Réti ◽  
Abolape Akwu
Keyword(s):  
Lower Bounds ◽  
Molecular Graph ◽  
Wiener Index ◽  
Vertex Degree ◽  
Upper And Lower Bounds ◽  
Connected Graphs ◽  
Matrix Description ◽  
Vertex Set

Let G be a connected (molecular) graph with the vertex set V(G)={v1,⋯,vn}, and let di and σi denote, respectively, the vertex degree and the transmission of vi, for 1≤i≤n. In this paper, we aim to provide a new matrix description of the celebrated Wiener index. In fact, we introduce the Wiener–Hosoya matrix of G, which is defined as the n×n matrix whose (i,j)-entry is equal to σi2di+σj2dj if vi and vj are adjacent and 0 otherwise. Some properties, including upper and lower bounds for the eigenvalues of the Wiener–Hosoya matrix are obtained and the extremal cases are described. Further, we introduce the energy of this matrix.

scholarly journals On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 320 ◽  
Author(s):  
Young Kwun ◽  
Abaid Virk ◽  
Waqas Nazeer ◽  
M. Rehman ◽  
Shin Kang
Keyword(s):  
Molecular Structure ◽  
Graph Theory ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Topological Indices ◽  
Molecular Compound ◽  
Zagreb Indices ◽  
Silicon Carbon ◽  
Physico Chemical ◽  
Structure Research

The application of graph theory in chemical and molecular structure research has far exceeded people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonds by edges. Topological indices help us to predict many physico-chemical properties of the concerned molecular compound. In this article, we compute Generalized first and multiplicative Zagreb indices, the multiplicative version of the atomic bond connectivity index, and the Generalized multiplicative Geometric Arithmetic index for silicon-carbon Si2C3−I[p,q] and Si2C3−II[p,q] second.

scholarly journals Multiplicative Zagreb indices of cacti

2016 ◽  
Vol 08 (03) ◽  
pp. 1650040 ◽  
Author(s):  
Shaohui Wang ◽  
Bing Wei
Keyword(s):  
Graph Theory ◽  
Lower Bounds ◽  
Connected Graph ◽  
Upper And Lower Bounds ◽  
Extremal Graphs ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Material Chemistry ◽  
Cactus Graph ◽  
Cactus Graphs

Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs.

scholarly journals Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 227 ◽  
Author(s):  
Shaohui Wang ◽  
Chunxiang Wang ◽  
Lin Chen ◽  
Jia-Bao Liu ◽  
Zehui Shao
Keyword(s):  
Molecular Graph ◽  
Zagreb Index ◽  
Zagreb Indices

Given a (molecular) graph, the first multiplicative Zagreb index Π 1 is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index Π 2 is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G n , k having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G n , k are provided. We also provide these graphs with the largest and smallest Π 1 ( G ) and Π 2 ( G ) in G n , k .

scholarly journals Valency-based molecular descriptors of Bakelite network BNmn$B\text N_{m}^{n}$

2019 ◽  
Vol 17 (1) ◽  
pp. 663-670 ◽  
Author(s):  
Maqsood Ahmad ◽  
Muhammad Javaid ◽  
Muhammad Saeed ◽  
Chahn Yong Jung
Keyword(s):  
Physical Properties ◽  
Molecular Descriptors ◽  
Molecular Graph ◽  
Synthetic Polymer ◽  
Topological Indices ◽  
Qsar Studies ◽  
Zagreb Indices ◽  
Symmetric Division ◽  
Atom Bond

AbstractBakelite network $BN_{m}^{n}$is a molecular graph of bakelite, a pioneering and revolutionary synthetic polymer (Thermosetting Plastic) and regarded as the material of a thousand uses. In this paper, we aim to compute various degree-based topological indices of a molecular graph of bakelite network $BN_{m}^{n}$. These molecular descriptors play a fundamental role in QSPR/QSAR studies in describing the chemical and physical properties of Bakelite network $BN_{m}^{n}$. We computed atom-bond connectivity ABC its fourth version ABC4 geometric arithmetic GA its fifth version GA5 Narumi-Katayama, sum-connectivity and Sanskruti indices, first, second, modified and augmented Zagreb indices, inverse and general Randic’ indices, symmetric division, harmonic and inverse sum indices of $BN_{m}^{n}$.

scholarly journals On Multiple Zagreb Indices of Dendrimer Nanostars

2015 ◽  
Vol 52 ◽  
pp. 147-151 ◽  
Author(s):  
Mohammad Reza Farahani
Keyword(s):  
Topological Indices ◽  
Infinite Class ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Degree Of A Vertex

In this paper, we focus on the structure of an infinite class of Dendrimer Nanostars D3[n] (n≥0 is infinite integer) and counting its First Multiple Zagreb index and Second Multiple Zagreb index. The Multiple Zagreb topological indices are equal to PM1(G)=(dv+dv) and PM2(G)=(dv×dv), where dv is the degree of a vertex v.

scholarly journals Hyper Zagreb indices of composite graphs

2016 ◽  
Vol 4 (2) ◽  
pp. 47 ◽  
Author(s):  
Sharmila Devi ◽  
V. Kaladevi
Keyword(s):  
Molecular Graph ◽  
Sum Of Squares ◽  
First Zagreb Index ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Second Zagreb Index ◽  
The First Zagreb Index ◽  
Thorn Graph

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the degrees of vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Similarly, the hyper Zagreb index is defined as the sum of square of degree of vertices over all the edges.  In this paper, First we obtain the hyper Zagreb indices of some derived graphs and the generalized transformations graphs. Finally, the hyper Zagreb indices of double, extended double, thorn graph, subdivision vertex corona of graphs, Splice and link graphs are obtained.

On the First and Second Zagreb and First and Second Hyper-Zagreb Indices of Carbon Nanocones CNCk[n]

2016 ◽  
Vol 13 (10) ◽  
pp. 7475-7482 ◽  
Author(s):  
Wei Gao ◽  
Mohammad Reza Farahani ◽  
Muhammad Kamran Siddiqui ◽  
Muhammad Kamran Jamil
Keyword(s):  
Molecular Graph ◽  
Topological Indices ◽  
Zagreb Index ◽  
Carbon Nanocones ◽  
Zagreb Indices ◽  
Minimum Path ◽  
Multiple Edges

Let G be a simple molecular graph without directed and multiple edges and without loops, the vertex and edge-sets of which are represented by V(G) and E(G), respectively. Suppose G is a connected molecular graph and vertices u, v ∈ V(>G). The distance dG(u,v) (or d(u,v) for short) between vertices u and V of G is defined as the length of a minimum path between u and V. The first and second Zagreb indices of a graph G are defined as M1(G) = ΣE=uv∈E(G)(dV+dV) and M2(G) = ΣE=uv∈E(G)(dV×dv) where du and dv are the degree of the vertices u and V of G. Recently the Hyper-Zagreb index of a graph G is defined as HM(G) = ΣE=uv∈E(G)(dV+dV)2, by Shirdel et al. In this paper, we define a new version of Zagreb topological indices, on based the Hyper-Zagreb index that defined as the sum of the weights (dudV)2 and the Second Hyper-Zagreb index of G is equal to HM2(G) = ΣE=uv∈E(G)(dVdV)22. In continue, exact formulas for the first and second Zagreb and Hyper-Zagreb indices of Carbon Nanocones CNCk[n] are computed.

Sign in / Sign up

Export Citation Format

Share Document