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.
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 ...
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Let G = (V(G), E(G)) be a molecular graph, where V(G) and E(G) are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity ...
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
For a graph, the SK index is equal to the half of the sum of the degrees of the vertices, the SK1 index is equal to the half of the product of the degrees of the vertices, and the ...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type I codes and Type II codes, as well as shadow codes. In this paper, we provide a...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...
Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
AbstractModel-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transiti...
Topological Properties of Degree‐Based Invariants via M‐Polynomial Approach
Topological Properties of Degree‐Based Invariants via M‐Polynomial Approach
Chemical graph theory provides a link between molecular properties and a molecular graph. The M‐polynomial is emerging as an efficient tool to recover the degree‐based topological ...

