Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Extremal Gourava indices of unicyclic graphs

View through CrossRef
Abstract Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (QSPR) and Quantitative Structure-Toxicity Relationship (QSTR). Recently, some novel topological indices of graphs, called the first Gourava index ($CO_1$) and the second Gourava index ($CO_2$), have been proposed to characterize the nature of chemical compounds or interconnection networks. The first and the second Gourava indices of the graph $G$ are denoted by $C{O_1}(G) =\sum\limits_{uv \in E(G)} {[{d_u}} + {d_v} + {d_u}{d_v}]$ and $C{O_2}(G) = \sum\limits_{uv \in E(G)} {[({d_u}} + {d_v}){d_u}{d_v}]$, where $d_u$ is the degree of vertex $u$. In this work, we investigate the extremal values on the first and the second Gourava indices of $n$-vertex unicyclic graphs and characterize the unicyclic graphs that achieve the extremes. We show that, for $n$-vertex unicyclic graph $G$, $8n \le C{O_1}(G) \le 2{n^2} - n + 9$ and $16n \le C{O_2}(G) \le n^3 +3n + 12$, where the lower bound is achieved by $C_n$ and the upper bound is achieved by $G_{3,1}^{(n)}$, which is obtained by attaching $n- 3$ leaves to one vertex of $C_3$. Furthermore, we investigate the applications of Gourava indices to the benzenoid hydrocarbons and show that they can predict the physico-chemical properties of molecules precisely.
Research Square Platform LLC
Title: Extremal Gourava indices of unicyclic graphs
Description:
Abstract Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (QSPR) and Quantitative Structure-Toxicity Relationship (QSTR).
Recently, some novel topological indices of graphs, called the first Gourava index ($CO_1$) and the second Gourava index ($CO_2$), have been proposed to characterize the nature of chemical compounds or interconnection networks.
The first and the second Gourava indices of the graph $G$ are denoted by $C{O_1}(G) =\sum\limits_{uv \in E(G)} {[{d_u}} + {d_v} + {d_u}{d_v}]$ and $C{O_2}(G) = \sum\limits_{uv \in E(G)} {[({d_u}} + {d_v}){d_u}{d_v}]$, where $d_u$ is the degree of vertex $u$.
In this work, we investigate the extremal values on the first and the second Gourava indices of $n$-vertex unicyclic graphs and characterize the unicyclic graphs that achieve the extremes.
We show that, for $n$-vertex unicyclic graph $G$, $8n \le C{O_1}(G) \le 2{n^2} - n + 9$ and $16n \le C{O_2}(G) \le n^3 +3n + 12$, where the lower bound is achieved by $C_n$ and the upper bound is achieved by $G_{3,1}^{(n)}$, which is obtained by attaching $n- 3$ leaves to one vertex of $C_3$.
Furthermore, we investigate the applications of Gourava indices to the benzenoid hydrocarbons and show that they can predict the physico-chemical properties of molecules precisely.

Related Results

NIRMALA ALPHA GOURAVA AND MODIFIED NIRMALA ALPHA GOURAVA INDICES OF CERTAIN DENDRIMERS
NIRMALA ALPHA GOURAVA AND MODIFIED NIRMALA ALPHA GOURAVA INDICES OF CERTAIN DENDRIMERS
In this paper, we introduce the Nirmala alpha Gourava and modified Nirmala alpha Gourava indices and their corresponding exponentials of a graph. Also we compute the Nirmala alpha ...
Degree-Based Index Optimization in Trees with Pendant Constraints
Degree-Based Index Optimization in Trees with Pendant Constraints
Graphs are used in mathematics to mathematically depict net works, which are essentially collections of interconnected things. The  topology and structure of networks and molecular...
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...
Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices
Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal ones, that is, those that maximize or minimize 33 degree-...
On Trees with Given Independence Numbers with Maximum Gourava Indices
On Trees with Given Independence Numbers with Maximum Gourava Indices
In mathematical chemistry, molecular descriptors serve an important role, primarily in quantitative structure–property relationship (QSPR) and quantitative structure–activity relat...
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...

Back to Top