scholarly journals Computing Exact Values for Gutman Indices of Sum Graphs under Cartesian Product

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Abdulaziz Mohammed Alanazi ◽  
Faiz Farid ◽  
Muhammad Javaid ◽  
Augustine Munagi
Keyword(s):  
Connected Graph ◽  
Topological Index ◽  
Cartesian Product ◽  
Chemical Compounds ◽  
Factor Graphs ◽  
Cartesian Products ◽  
Degree Distance ◽  
Gutman Index ◽  
Extremal Theory ◽  
Theory Of Graphs

Gutman index of a connected graph is a degree-distance-based topological index. In extremal theory of graphs, there is great interest in computing such indices because of their importance in correlating the properties of several chemical compounds. In this paper, we compute the exact formulae of the Gutman indices for the four sum graphs (S-sum, R-sum, Q-sum, and T-sum) in the terms of various indices of their factor graphs, where sum graphs are obtained under the subdivision operations and Cartesian products of graphs. We also provide specific examples of our results and draw a comparison with previously known bounds for the four sum graphs.

scholarly journals On the reformulated reciprocal degree distance of graphs

2016 ◽  
Vol 25 (2) ◽  
pp. 205-213
Author(s):  
K. PATTABIRAMAN ◽  
◽  
M. VIJAYARAGAVAN ◽  
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Vertex Degree ◽  
Symmetric Difference ◽  
Weighted Sum ◽  
Graph Invariant ◽  
Harary Index ◽  
Degree Distance

The reciprocal degree distance (RDD), defined for a connected graph G as vertex-degree-weighted sum of the reciprocal distances, that is, RDD(G) = P u,v∈V (G) (d(u)+d(v)) dG(u,v) . The new graph invariant named reformulated reciprocal degree distance is defined for a connected graph G as Rt(G) = P u,v∈V (G) (d(u)+d(v)) dG(u,v)+t , t ≥ 0. The reformulated reciprocal degree distance is a weight version of the t-Harary index, that is, Ht(G) = P u,v∈V (G) 1 dG(u,v)+t , t ≥ 0. In this paper, the reformulated reciprocal degree distance and reciprocal degree distance of disjunction, symmetric difference, Cartesian product of two graphs are obtained. Finally, we obtain the reformulated reciprocal degree distance and reciprocal degree distance of double a graph.

scholarly journals Computing Analysis for First Zagreb Connection Index and Coindex of Resultant Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-19 ◽  
Author(s):  
Muhammad Javaid ◽  
Usman Ali ◽  
Jia-Bao Liu
Keyword(s):  
Tensor Product ◽  
Physicochemical Properties ◽  
Electron Energy ◽  
Topological Index ◽  
Chemical Compounds ◽  
Upper Bounds ◽  
Symmetric Difference ◽  
Factor Graphs ◽  
Strong Product ◽  
Alternant Hydrocarbons

A numeric parameter which studies the behaviour, structural, toxicological, experimental, and physicochemical properties of chemical compounds under several graphs’ isomorphism is known as topological index. In 2018, Ali and Trinajstić studied the first Zagreb connection index Z C 1 to evaluate the value of a molecule. This concept was first studied by Gutman and Trinajstić in 1972 to find the solution of π -electron energy of alternant hydrocarbons. In this paper, the first Zagreb connection index and coindex are obtained in the form of exact formulae and upper bounds for the resultant graphs in terms of different indices of their factor graphs, where the resultant graphs are obtained by the product-related operations on graphs such as tensor product, strong product, symmetric difference, and disjunction. At the end, an analysis of the obtained results for the first Zagreb connection index and coindex on the aforesaid resultant graphs is interpreted with the help of numerical values and graphical depictions.

scholarly journals Steiner Degree Distance of Two Graph Products

2019 ◽  
Vol 27 (2) ◽  
pp. 83-99 ◽  
Author(s):  
Yaping Mao ◽  
Zhao Wang ◽  
Kinkar Ch. Das
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Graph Products ◽  
Product Graphs ◽  
Degree Distance ◽  
Cartesian Product Graphs

AbstractThe degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDD_k (G) = \sum\limits_{\mathop {S \subseteq V(G)}\limits_{\left| S \right| = k} } {\left[ {\sum\limits_{v \in S} {{\it deg} _G (v)} } \right]d_G (S),} where dG(S) is the Steiner k-distance of S and degG(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.

Wiener index via wirelength of an embedding

2021 ◽  
pp. 2150087
Author(s):  
G. Kirithiga Nandini ◽  
R. Sundara Rajan ◽  
T. M. Rajalaxmi ◽  
A. Arul Shantrinal ◽  
Sharifah Kartini Said Husain ◽  
...  
Keyword(s):  
Asymptotic Relation ◽  
Cartesian Product ◽  
Chemical Compounds ◽  
Wiener Index ◽  
Theoretical Chemistry ◽  
Complete Graphs ◽  
Cartesian Products ◽  
Structural Graph ◽  
Data Program ◽  
High Level

Embeddings are often viewed as a high-level representation of systematic methods to simulate an algorithm designed for one kind of parallel machine on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors. A topological index is a numeric quantity of a molecule that is mathematically derived in an unambiguous way from the structural graph of a molecule. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. Arguably, the best known of these indices is the Wiener index, defined as the sum of all distances between distinct vertices. In this paper, we have obtained the exact wirelength of embedding Cartesian products of complete graphs into a Cartesian product of paths and cycles, and generalized book. In addition to that, we have found the Wiener index of generalized book and the relation between the Wiener index and wirelength of an embedding, which solves (partially) an open problem proposed in Kumar et al. [K. J. Kumar, S. Klavžar, R. S. Rajan, I. Rajasingh and T. M. Rajalaxmi, An asymptotic relation between the wirelength of an embedding and the Wiener index, submitted to the journal].

A note on Steiner reciprocal degree distance

2020 ◽  
Vol 12 (04) ◽  
pp. 2050050
Author(s):  
D. Sarala ◽  
S. K. Ayyaswamy ◽  
S. Balachandran ◽  
K. Kannan
Keyword(s):  
Connected Graph ◽  
Natural Generalization ◽  
Bipartite Graphs ◽  
Graph Distance ◽  
Straightforward Method ◽  
Steiner Formula ◽  
Degree Distance ◽  
Complete Bipartite Graphs ◽  
Gutman Index ◽  
Distance Formula

The concept of reciprocal degree distance [Formula: see text] of a connected graph [Formula: see text] was introduced in 2012. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. The [Formula: see text]-center Steiner reciprocal degree distance defined as [Formula: see text], where [Formula: see text] is the Steiner [Formula: see text]-distance of [Formula: see text] and [Formula: see text] is the degree of the vertex [Formula: see text] in [Formula: see text]. Motivated from Zhang’s paper [X. Zhang, Reciprocal Steiner degree distance, Utilitas Math., accepted for publication], we find the expression for [Formula: see text] of complete bipartite graphs. Also, we give a straightforward method to compute Steiner Gutman index and Steiner degree distance of path.

scholarly journals THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES

2020 ◽  
pp. 1-10
Author(s):  
JING TIAN ◽  
KEXIANG XU ◽  
SANDI KLAVŽAR
Keyword(s):  
Shortest Path ◽  
Connected Graph ◽  
General Position ◽  
Cartesian Product

Abstract The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position number is additive on the Cartesian product of two trees.

scholarly journals Peg Solitaire on Cartesian Products of Graphs

2021 ◽  
Vol 37 (3) ◽  
pp. 907-917
Author(s):  
Martin Kreh ◽  
Jan-Hendrik de Wiljes
Keyword(s):  
Cartesian Product ◽  
Cartesian Products ◽  
Connected Graphs ◽  
Grid Graphs ◽  
Cartesian Products Of Graphs

AbstractIn 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs. We extend these results to Cartesian products of certain unsolvable graphs. In particular, we prove that ladders and grid graphs are solvable and, further, even the Cartesian product of two stars, which in a sense are the “most” unsolvable graphs.

ON MOSTAR INDEX OF GRAPHS

2021 ◽  
Vol 10 (4) ◽  
pp. 2115-2129
Author(s):  
P. Kandan ◽  
S. Subramanian
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Bipartite Graphs ◽  
Topological Indices ◽  
Great Success ◽  
Complete Graphs ◽  
Molecular Graphs ◽  
Graphs And Networks ◽  
Complete Bipartite Graphs ◽  
Simple Connected Graph

On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon E(G)}}C(gh),$$ where $C(gh) \,=\,\left|n_{g}(e)-n_{h}(e)\right|$ be the contribution of edge $uv$ and $n_{g}(e)$ denotes the number of vertices of $G$ lying closer to vertex $g$ than to vertex $h$ ($n_{h}(e)$ define similarly). In this paper, we prove a general form of the results obtained by $Do\check{s}li\acute{c}$ et al.\cite{18} for compute the Mostar index to the Cartesian product of two simple connected graph. Using this result, we have derived the Cartesian product of paths, cycles, complete bipartite graphs, complete graphs and to some molecular graphs.

scholarly journals A Computational Approach on Acetaminophen Drug using Degree-Based Topological Indices and M-Polynomials

2021 ◽  
Vol 12 (6) ◽  
pp. 7249-7266
Keyword(s):  
Biological Activity ◽  
Physicochemical Properties ◽  
Chemical Structure ◽  
Topological Index ◽  
Chemical Reactivity ◽  
Chemical Compounds ◽  
Computational Approach ◽  
Topological Indices ◽  
Numerical Representation ◽  
Essential Drug

Topological index is a numerical representation of a chemical structure. Based on these indices, physicochemical properties, thermodynamic behavior, chemical reactivity, and biological activity of chemical compounds are calculated. Acetaminophen is an essential drug to prevent/treat various types of viral fever, including malaria, flu, dengue, SARS, and even COVID-19. This paper computes the sum and multiplicative version of various topological indices such as General Zagreb, General Randić, General OGA, AG, ISI, SDD, Forgotten indices M-polynomials of Acetaminophen. To the best of our knowledge, for the Acetaminophen drugs, these indices have not been computed previously.

scholarly journals Computing Fifth Geometric-Arithmetic Index for Circumcoronene series of benzenoid Hk

2007 ◽  
Vol 3 (1) ◽  
pp. 143-148 ◽  
Author(s):  
Mohammad Reza Farahani
Keyword(s):  
Connected Graph ◽  
Topological Index ◽  
Degree Of Vertex ◽  
Simple Connected Graph ◽  
Ga Index

Let G=(V; E) be a simple connected graph. The sets of vertices and edges of G are denoted by V=V(G) and E=E (G), respectively. The geometric-arithmetic index is a topological index was introduced by Vukicevic and Furtula in 2009 and defined as  in which degree of vertex u denoted by dG(u) (or du for short). In 2011, A. Graovac et al defined a new version of GA index as  where  The goal of this paper is to compute the fifth geometric-arithmetic index for "Circumcoronene series of benzenoid Hk (k≥1)".

Sign in / Sign up

Export Citation Format

Share Document