Search engine for discovering works of Art, research articles, and books related to Art and Culture
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...
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 –...
P-668 The LH endocrine profile in Gonadotropin-Releasing Hormone analogue cycles
P-668 The LH endocrine profile in Gonadotropin-Releasing Hormone analogue cycles
Abstract
Study question
What does the evolution of luteinizing hormone (LH) throughout the follicular phase look like in differe...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...
Total edge–vertex domination
Total edge–vertex domination
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G...
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...
Strong vb-dominating and vb-independent sets of a graph
Strong vb-dominating and vb-independent sets of a graph
Let [Formula: see text] be a graph. A vertex [Formula: see text] strongly (weakly) b-dominates block [Formula: see text] if [Formula: see text] ([Formula: see text]) for every vert...