scholarly journals On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k

Filomat ◽  
2011 ◽  
Vol 25 (4) ◽  
pp. 75-83 ◽  
Author(s):  
Guifu Su ◽  
Liming Xiong ◽  
Lan Xu ◽  
Beibei Ma

The authors Milicevic et al. introduced the reformulated Zagreb indices [1], which is a generalization of classical Zagreb indices of chemical graph theory. In this paper, we mainly consider the maximum and minimum for the first reformulated index of graphs with connectivity at most k. The corresponding extremal graphs are characterized.

2018 ◽  
Vol 11 (05) ◽  
pp. 1850064 ◽  
Author(s):  
Akbar Ali

In the chemical graph theory, graph invariants are usually referred to as topological indices. The second Zagreb index (denoted by [Formula: see text]) is one of the most studied topological indices. For [Formula: see text], let [Formula: see text] be the collection of all non-isomorphic connected graphs with [Formula: see text] vertices and [Formula: see text] edges (such graphs are known as tetracyclic graphs). Recently, Habibi et al. [Extremal tetracyclic graphs with respect to the first and second Zagreb indices, Trans. on Combin. 5(4) (2016) 35–55.] characterized the graph having maximum [Formula: see text] value among all members of the collection [Formula: see text]. In this short note, an alternative but relatively simple approach is used for characterizing the aforementioned graph.


2020 ◽  
Vol 43 (1) ◽  
pp. 219-228
Author(s):  
Ghulam Dustigeer ◽  
Haidar Ali ◽  
Muhammad Imran Khan ◽  
Yu-Ming Chu

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.


2016 ◽  
Vol 08 (03) ◽  
pp. 1650040 ◽  
Author(s):  
Shaohui Wang ◽  
Bing Wei

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.


Author(s):  
Mohammed Alsharafi ◽  
Yusuf Zeren ◽  
Abdu Alameri

In chemical graph theory, a topological descriptor is a numerical quantity that is based on the chemical structure of underlying chemical compound. Topological indices play an important role in chemical graph theory especially in the quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR). In this paper, we present explicit formulae for some basic mathematical operations for the second hyper-Zagreb index of complement graph containing the join G1 + G2, tensor product G1 \(\otimes\) G2, Cartesian product G1 x G2, composition G1 \(\circ\) G2, strong product G1 * G2, disjunction G1 V G2 and symmetric difference G1 \(\oplus\) G2. Moreover, we studied the second hyper-Zagreb index for some certain important physicochemical structures such as molecular complement graphs of V-Phenylenic Nanotube V PHX[q, p], V-Phenylenic Nanotorus V PHY [m, n] and Titania Nanotubes TiO2.


2018 ◽  
Vol 26 (1) ◽  
pp. 91-104 ◽  
Author(s):  
Prosanta Sarkar ◽  
Nilanjan De ◽  
Anita Pal

Abstract In chemical graph theory, chemical structures are model edthrough a graph where atoms are considered as vertices and edges are bonds between them. In chemical sciences, topological indices are used for understanding the physicochemical properties of molecules. In this work, we study the generalized Zagreb index for three types of carbon allotrope’s theoretically.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Wang Zhen ◽  
Parvez Ali ◽  
Haidar Ali ◽  
Ghulam Dustigeer ◽  
Jia-Bao Liu

A molecular graph is used to represent a chemical molecule in chemical graph theory, which is a branch of graph theory. A graph is considered to be linked if there is at least one link between its vertices. A topological index is a number that describes a graph’s topology. Cheminformatics is a relatively young discipline that brings together the field of sciences. Cheminformatics helps in establishing QSAR and QSPR models to find the characteristics of the chemical compound. We compute the first and second modified K-Banhatti indices, harmonic K-Banhatti index, symmetric division index, augmented Zagreb index, and inverse sum index and also provide the numerical results.


Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 689
Author(s):  
José M. Rodríguez ◽  
José L. Sánchez ◽  
José M. Sigarreta ◽  
Eva Tourís

The concept of arithmetic-geometric index was recently introduced in chemical graph theory, but it has proven to be useful from both a theoretical and practical point of view. The aim of this paper is to obtain new bounds of the arithmetic-geometric index and characterize the extremal graphs with respect to them. Several bounds are based on other indices, such as the second variable Zagreb index or the general atom-bond connectivity index), and some of them involve some parameters, such as the number of edges, the maximum degree, or the minimum degree of the graph. In most bounds, the graphs for which equality is attained are regular or biregular, or star graphs.


Author(s):  
Mohammad Reza Farahani ◽  
Wei Gao ◽  
Abdul Qudair Baig ◽  
Wasaq Khalid

Graph theory has much advancement in the field of mathematical chemistry. Recently, chemical graph theory has become very popular among researchers because of its wide applications in mathematical chemistry. The molecular topological descriptors are the numerical invariants of a molecular graph and are very useful for predicting their bioactivity. A great variety of such indices are studied and used in theoretical chemistry, pharmaceutical researchers, in drugs and in different other fields.In this article, we study the chemical graph of copper oxide and compute degree based topological indices mainly ABC, GA, ABC4, GA5, general Randić index and Zagreb index for copper(II) oxide, CuO. Furthermore, we give exact formulas of these indices which are helpful in studying the underlying topologies.


2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Hai-Xia Li ◽  
Sarfaraz Ahmad ◽  
Iftikhar Ahmad

In the fields of chemical graph theory, topological index is a type of a molecular descriptor that is calculated based on the graph of a chemical compound. In this paper, M-polynomial OKn and OPn networks are computed. The M-polynomial is rich in information about degree-based topological indices. By applying the basic rules of calculus on M-polynomials, the first and second Zagreb indices, modified second Zagreb index, general Randić index, inverse Randić index, symmetric division index, harmonic index, inverse sum index, and augmented Zagreb index are recovered.


Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 140
Author(s):  
Kinkar Chandra Das ◽  
Ahmet Sinan Çevik ◽  
Ismail Naci Cangul ◽  
Yilun Shang

The concept of Sombor index (SO) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index SO: SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is the degree of vertex vi in G. Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the first and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.


Sign in / Sign up

Export Citation Format

Share Document