1. Introduction
Let be an undirected simple graph with vertex set and edge set E. The degree is the number of edges connecting to the vertex u in the G. The distance between vertices u and v in G is the length of the shortest path connecting u and v.
The Gutman index of the graph
G is the sum of the products of the distance of pairs of unordered vertices and their vertex degrees, i.e.,
where
is called the degree distance of the vertex
u, denoted as
.
is called the vertex Gutman index of
u, denoted as
. The Gutman index of the graph
G can also be expressed as
, i.e.,
Path
is a non-null graph whose vertex set and edge set are, respectively,
Here, all the
are different from each other. Vertices
and
are connected by path
P and called endpoints or ends of the path, and
is called the internal vertex of
P. The path of length
k is designated as
. If a path is closed, that is, it has a positive length and the same beginning as the end, then it is a cycle. A cycle with length
n is referred to as
.
The topological index of a graph is an invariant derived from the molecular structure graph of a compound. It is often used to study the structural properties or characteristics of molecules, allowing for numerical calculation of molecular structure information. The topological index of the distance between vertices plays a vital role in describing the molecular graph and establishing the relationship between molecular structure and features. In [
1], Dobrynin and Kochetova introduced a variant of the Wiener index, the degree distance (later known as the Schultz index) of the graph based on vertex degree and distance. In [
2], Klavzar and Gutman changed the sum of any two degrees in the Schultz index to the product of degrees, defining the improved Schultz index and later the Gutman index. In [
3], Gutman et al. formally introduced the Gutman index based on graph invariants of degree and distance, expanding the field of graph parameters related to vertex degree and distance. Subsequently, it has been studied by numerous experts and scholars. In [
4], Feng et al. studied the Gutman index of unicyclic graphs with given pendant edges. The (vertex) degree distance and Gutman index of one vertex union of two cycles were given in [
5,
6], and new methods for calculating them were explored in [
7]. In [
8], Das et al. generalized the well-known Gutman index by introducing the general Gutman index of a graph. The recent literature has discussed the association and comparison between the degree distance and Gutman index [
9,
10,
11], respectively. The extremal generalized Gutman index of trees was studied in [
12]. In [
13], Liu et al. focused on minimizing the Gutman index among unicyclic graphs with a given matching number. In [
14,
15], the scholars studied an even cycle and low-stretch trees. And the latest relevant studies are available in [
16,
17]. They studied the Sombor index of cycle graphs and the Gutman index of spiro and polyphenyl hexagonal chains. However, there are few papers that link cycle graphs with the Gutman index, so this article begins to explore this.
The in-depth study of the path union and double intersection union of two cycles presented in this article represents a significant deepening and refinement of previous research areas, delving into a more intricate and sophisticated analysis of topological structures. This paper aims to further elucidate the inherent connections between the profound characteristics and properties of molecular structures by exploring the vertex Gutman index, Gutman index, and their extremum within these complex structures.
Based on an understanding of the , this paper studies the vertex Gutman index and Gutman index on the and , comparing the maximum and minimum of their (vertex) Gutman index, which improves the results of the Gutman index of the union of double circles.
In the following,
and
and
indicate roads with length
k and circles of length
m and
n, respectively. The
s indicates the number of odd numbers in
.
,
, and
represent the single intersection union, path union, and double intersection union of
and
, respectively (see
Figure 1,
Figure 2 and
Figure 3 for details). Where
,
.
Due to the symmetry of the graph structure [
18], for convenience, let
,
4. The Gutman Index of the
4.1. The First Situation:
Lemma 13. The Gutman index of the intersection c of and is: Proof. Due to the symmetry of the graph, we only consider the vertex of
. By the definition of the vertex Gutman index
Case 1: m and n are both odd or even.
(1) If
is even, then
(2) If
is odd, similarly,
Case 2: m is odd, n is even.
(1) If
is even, then
(2) If is odd, similarly,
Case 3: Similarly, the conclusion holds when m is an even number and n is an odd number. □
Lemma 14. The Gutman index for the vertices in the cycle is: Proof. Let
,
. Defined by the Gutman index of the vertex
Due to the symmetry of the vertex, we only consider
,
and
.
Case 1: m and n are both odd or even.
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) Similarly, when is odd, the conclusion holds.
Case 2: m is odd, n is even.
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) Similarly, when is odd, the conclusion holds.
Case 3: Similarly, the conclusion holds when m is an even number and n is an odd number. □
From the symmetry of the graph structure, we obtain Lemma 15 by contrast.
Lemma 15. The Gutman index for the vertices in the cycle is: It is easy to obtain the following two Lemmas from Lemma 14 to 15.
Theorem 10.
Proof. According to Lemma 13 to 15, then
,
Thus,
. □
Theorem 11. The Gutman index of the iswhere Proof. By the definition of the Gutman index of graph
Case 1: are both odd or even.
(1) If
is even, then
(2) If
is odd, similarly, then
Case 2: m is odd, n is even.
(1) If
is even, then
(2) If
is odd, similarly, then
Case 3: Similarly, the conclusion holds when m is an even number and n is an odd number. □
Considering that the second and third situation proof methods are similar to the first situation, in the following proofs, we only consider that m and n are both odd numbers.
4.2. The Second Situation: ,
Lemma 18. The Gutman index of the intersection of and is Proof. Due to the symmetry of the graph, we only consider the vertex of
. By the definition of the vertex Gutman index
Let
m and
n be odd. We discuss different cases.
Case 1: .
(1) If
is even, then
(2) If is odd, similarly, the conclusion holds.
Case 2: .
(1) If
is even, then
(2) If is odd, similarly, the conclusion holds. □
Lemma 19. The Gutman index for the vertices in the cycle is
(1) When , then (2) When , then Proof. Let
,
. Defined by the Gutman index of the vertex
Let m and n be odd. We discuss different cases.
Case 1: . Due to the symmetry of the vertex, we only consider , and .
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) Similarly, when is odd, the conclusion holds.
Case 2: . Due to the symmetry of the vertex, we only consider , , and .
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) If
is even,
, then
(5) Similarly, when is odd, the conclusion holds. □
From the symmetry of the graph structure, we obtain Lemma 20 by contrast.
Lemma 20. The Gutman index for the vertices in the cycle is
(1) When , then (2) When , then It is easy to obtain the following two Lemmas from Lemma 19 to 20.
- (1)
When , then
- (2)
When , then
Proof. We discuss different cases according to Lemma 18 to 20. we discuss in different cases
(1) If
, then
Thus,
.
(2) If
, then
Thus,.
In summary, the conclusion holds. □
Theorem 13. The Gutman index of the is
(1) When , then (2) When , thenwhere Proof. By the definition of the Gutman index of graph
Let
m and
n be odd. We discuss different cases.
Case 1: .
(1) If
is even, then
(2) If is odd, similarly, then
Case 2: . □
From the symmetry of the graph structure, the conclusion clearly holds.
4.3. The Third Situation: ,
Lemma 23. The Gutman index of the intersection of and is: Proof. Due to the symmetry of the graph, we only consider the vertex of
. By the definition of the vertex Gutman index
Let
m and
n be odd. We discuss different cases.
Case 1: .
(1) If
is even, then
(2) If is odd, similarly, the conclusion holds.
Case 2: .
(1) If
is even, then
(2) If is odd, similarly, the conclusion holds.
□
Lemma 24. The Gutman index for the vertices in the cycle is
(1) When , then (2) When , then Proof. Let
,
. Defined by the Gutman index of the vertex
Let
m and
n be odd. We discuss different cases.
Case 1: . Due to the symmetry of the vertex, we only consider , and .
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) Similarly, when is odd, the conclusion holds.
Case 2: . Due to the symmetry of the vertex, we only consider , , and .
(1) If
is even,
, then
(2) If
is even,
, then
(3) If
is even,
, then
(4) If
is even,
, then
(5) Similarly, when is odd, the conclusion holds. □
From the symmetry of the graph structure, we obtain Lemma 25 by contrast.
Lemma 25. The Gutman index for the vertices in the cycle is
(1) When , then (2) When , then It is easy to obtain the following two Lemmas from Lemma 24 to 25.
Lemma 27. (1) When , then (2) When , then Proof. We discuss different cases from Lemma 23 to 25.
(1) If
, then
Thus,
.
(2) If , then
Thus,
. □
In summary, the conclusion holds.
Since when
, the case is the same as in
Section 3.1, when
, the case is the same as for
in
Section 3.2. Therefore, the following theorem can be drawn directly.
Theorem 15. The Gutman index of the is
(1) When , then (2) When , then From the above three situations, the vertex Gutman index of is the maximum at the intersection or the farthest distance from the intersection, and the minimum at some vertices closest to the intersection.
By comparing the vertex Gutman index, Gutman index, and the extremum of under different parameters, we can gain insights into how the arrangement and nature of the bonds affect the overall properties of the molecule and can predict and explain the behavior of molecules with similar graph structures.
5. Conclusions
Based on the Gutman index of degree and distance, we have made full use of algebraic theory, classification discussion, and calculation skills of logical reasoning to describe the intersection of all double-circle graphs, and summarized that the (vertex) Gutman index of , , and is the maximum at the intersection (endpoint) or the farthest distance from the intersection (endpoint) and the minimum at some vertices closest to the intersection (endpoint).
Our future research directions may delve deeper into the vertex Gutman index, Gutman index, and their extremal properties related to pairwise intersecting cycles in tricyclic or even higher-order cyclic graphs. We expect to draw consistent conclusions from the structure of such graphs to obtain extremum at the same position. And we make similar considerations for paths. Such graphs share similarities with the resonance structures of benzene and its derivatives in chemistry. Therefore, studying them can assist us in understanding and analyzing the distribution and flow of electrons within chemical molecules, ultimately leading to a deeper understanding of their chemical properties and reaction mechanisms.