Javascript must be enabled to continue!
Gutman Connection Index of Graphs under Operations
View through CrossRef
In the modern era, mathematical modeling consisting of graph theoretic parameters or invariants applied to solve the problems existing in various disciplines of physical sciences like computer sciences, physics, and chemistry. Topological indices (TIs) are one of the graph invariants which are frequently used to identify the different physicochemical and structural properties of molecular graphs. Wiener index is the first distance-based TI that is used to compute the boiling points of the paraffine. For a graph F, the recently developed Gutman Connection (GC) index is defined on all the unordered pairs of vertices as the sum of the multiplications of the connection numbers and the distance between them. In this note, the GC index of the operation-based symmetric networks called by first derived graph D1(F) (subdivision graph), second derived graph D2(F) (vertex-semitotal graph), third derived graph D3(F) (edge-semitotal graph) and fourth derived graph D4(F) (total graph) are computed in their general expressions consisting of various TIs of the parent graph F, where these operation-based symmetric graphs are obtained by applying the operations of subdivision, vertex semitotal, edge semitotal and the total on the graph F respectively.
Title: Gutman Connection Index of Graphs under Operations
Description:
In the modern era, mathematical modeling consisting of graph theoretic parameters or invariants applied to solve the problems existing in various disciplines of physical sciences like computer sciences, physics, and chemistry.
Topological indices (TIs) are one of the graph invariants which are frequently used to identify the different physicochemical and structural properties of molecular graphs.
Wiener index is the first distance-based TI that is used to compute the boiling points of the paraffine.
For a graph F, the recently developed Gutman Connection (GC) index is defined on all the unordered pairs of vertices as the sum of the multiplications of the connection numbers and the distance between them.
In this note, the GC index of the operation-based symmetric networks called by first derived graph D1(F) (subdivision graph), second derived graph D2(F) (vertex-semitotal graph), third derived graph D3(F) (edge-semitotal graph) and fourth derived graph D4(F) (total graph) are computed in their general expressions consisting of various TIs of the parent graph F, where these operation-based symmetric graphs are obtained by applying the operations of subdivision, vertex semitotal, edge semitotal and the total on the graph F respectively.
Related Results
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
The Vertex Gutman Index and Gutman Index of the Union of Two Cycles
The Vertex Gutman Index and Gutman Index of the Union of Two Cycles
The Wiener index is one of the most classic and widely used indicators in topology. It reflects the average distance of any node pair in the graph. It not only makes the boundaries...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between v...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
EKSPLORASI INDEKS GUTMAN PADA GRAF MOLEKULER BERBASIS GRUP HINGGA
EKSPLORASI INDEKS GUTMAN PADA GRAF MOLEKULER BERBASIS GRUP HINGGA
Penelitian ini bertujuan untuk mengkaji dan mengembangkan rumus umum dari Gutman index dalam konteks graf molekuler yang terkait dengan grup hingga. Studi ini diawali dengan kajian...

