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

The Vertex Gutman Index and Gutman Index of the Union of Two Cycles

View through CrossRef
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 of given graphs clearer but also continuously generates topological indices that are more suitable for new fields, such as the Gutman index. The Wiener index and Gutman index are two important topological indices, which are commonly used to describe the characteristics of molecular structure. They are closely related to the physical and chemical properties of molecular compounds. And they are widely used to predict the physical and chemical properties and biological activity of molecular compounds. In this paper, we study the vertex Gutman index and Gutman index and describe the structural characteristics of all cases of two simple cycles intersecting. We comprehensively analyze the Gutman index and vertex Gutman index in these cases in detail by means of classification discussion and analogical reasoning and characterize their maximum and minimum accordingly.
Title: The Vertex Gutman Index and Gutman Index of the Union of Two Cycles
Description:
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 of given graphs clearer but also continuously generates topological indices that are more suitable for new fields, such as the Gutman index.
The Wiener index and Gutman index are two important topological indices, which are commonly used to describe the characteristics of molecular structure.
They are closely related to the physical and chemical properties of molecular compounds.
And they are widely used to predict the physical and chemical properties and biological activity of molecular compounds.
In this paper, we study the vertex Gutman index and Gutman index and describe the structural characteristics of all cases of two simple cycles intersecting.
We comprehensively analyze the Gutman index and vertex Gutman index in these cases in detail by means of classification discussion and analogical reasoning and characterize their maximum and minimum accordingly.

Related Results

Differential graded vertex Lie algebras
Differential graded vertex Lie algebras
This is the continuation of the study of differential graded (dg) vertex algebras defined in our previous paper [Caradot et al., “Differential graded vertex operator algebras and t...
Vertex energy of some integral graphs
Vertex energy of some integral graphs
Graph energy is one of the most significant aspects in mathematical chemistry that has generated a lot of interest in researchers over a long period of time. The concept of energy ...
Optimal Vertex Interval Determination for Efficient Shoreline Length Calculation
Optimal Vertex Interval Determination for Efficient Shoreline Length Calculation
<p>Coastline extraction and decisions have important implications for efficient land management and national policy formulation. Therefore, shorelines should be deter...
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph
A total graph labeling is an assignment of integers to the union of vertices and edges to certain conditions. The labeling becomes D -distance vertex irregular total k-labeling whe...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH
VERTEX COVERING TRANSVERSAL GEODOMATIC NUMBER OF A GRAPH
A geodetic set S ⊆ V in a simple graph G = (V, E), which intersects every minimum vertex covering set (α0-set), is called a vertex covering transversal geodetic set [7]. The minimu...
Double vertex-edge domination
Double vertex-edge domination
A vertex [Formula: see text] of a graph [Formula: see text] is said to [Formula: see text]-dominate every edge incident to [Formula: see text], as well as every edge adjacent to th...
The Role of Union Leader-Member Relationship Capital within Trade Union for Mental Health
The Role of Union Leader-Member Relationship Capital within Trade Union for Mental Health
Objective – There are three main objectives of this study. First, this study is to examine the influence of union effectiveness and perceived union support on union relationship ca...

Back to Top