Computation of chromatic zagreb indices of nanotubes and nanotori

2022 ◽  
Author(s):  
A. Albina ◽  
A. Manonmani
Keyword(s):  
Zagreb Indices

scholarly journals Some graph operations in multiplicative Zagreb indices

2020 ◽  
Author(s):  
M. Radhakrishnan ◽  
M. Suresh ◽  
V. Mohana Selvi
Keyword(s):  
Zagreb Indices ◽  
Graph Operations

scholarly journals Mathematical Properties of Variable Topological Indices

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 43
Author(s):  
José M. Sigarreta
Keyword(s):  
Real Number ◽  
Large Class ◽  
Symmetric Functions ◽  
Topological Indices ◽  
Current Interest ◽  
Zagreb Indices ◽  
Mathematical Properties ◽  
Connectivity Indices ◽  
Optimal Bounds ◽  
New Framework

A topic of current interest in the study of topological indices is to find relations between some index and one or several relevant parameters and/or other indices. In this paper we study two general topological indices Aα and Bα, defined for each graph H=(V(H),E(H)) by Aα(H)=∑ij∈E(H)f(di,dj)α and Bα(H)=∑i∈V(H)h(di)α, where di denotes the degree of the vertex i and α is any real number. Many important topological indices can be obtained from Aα and Bα by choosing appropriate symmetric functions and values of α. This new framework provides new tools that allow to obtain in a unified way inequalities involving many different topological indices. In particular, we obtain new optimal bounds on the variable Zagreb indices, the variable sum-connectivity index, the variable geometric-arithmetic index and the variable inverse sum indeg index. Thus, our approach provides both new tools for the study of topological indices and new bounds for a large class of topological indices. We obtain several optimal bounds of Aα (respectively, Bα) involving Aβ (respectively, Bβ). Moreover, we provide several bounds of the variable geometric-arithmetic index in terms of the variable inverse sum indeg index, and two bounds of the variable inverse sum indeg index in terms of the variable second Zagreb and the variable sum-connectivity indices.

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 Zagreb Indices of Edge Based on IB Product

2021 ◽  
Vol 1724 (1) ◽  
pp. 012036
Author(s):  
K. Pattabiraman ◽  
T. Suganya
Keyword(s):  
Zagreb Indices ◽  
Edge Based

Some formulae for the Zagreb indices of graphs

2012 ◽  
Author(s):  
Ismail Naci Cangul ◽  
Aysun Yurttas ◽  
Muge Togan ◽  
Ahmet Sinan Cevik
Keyword(s):  
Zagreb Indices

Inverse problem for Zagreb indices

2018 ◽  
Vol 57 (2) ◽  
pp. 609-615 ◽  
Author(s):  
Aysun Yurtas ◽  
Muge Togan ◽  
Veerebradiah Lokesha ◽  
Ismail Naci Cangul ◽  
Ivan Gutman
Keyword(s):  
Inverse Problem ◽  
Zagreb Indices

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 On chromatic Zagreb indices of certain graphs

2017 ◽  
Vol 09 (01) ◽  
pp. 1750014 ◽  
Author(s):  
Johan Kok ◽  
N. K. Sudev ◽  
U. Mary
Keyword(s):  
Connected Graph ◽  
Vertex Coloring ◽  
Zagreb Indices ◽  
Proper Vertex

Let [Formula: see text] be a finite and simple undirected connected graph of order [Formula: see text] and let [Formula: see text] be a proper vertex coloring of [Formula: see text]. Denote [Formula: see text] simply, [Formula: see text]. In this paper, we introduce a variation of the well-known Zagreb indices by utilizing the parameter [Formula: see text] instead of the invariant [Formula: see text] for all vertices of [Formula: see text]. The new indices are called chromatic Zagreb indices. We study these new indices for certain classes of graphs and introduce the notion of chromatically stable graphs.

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.

Sign in / Sign up

Export Citation Format

Share Document