Mathematical Problems in Engineering
Volume 2020 (2020), Article ID 5898735, 7 pages
https://doi.org/10.1155/2020/5898735

Research Article

Nordhaus–Gaddum-Type Relations for Arithmetic-Geometric Spectral Radius and Energy

Yajing Wang¹ and Yubin Gao²

¹School of Data Science and Technology, North University of China, Taiyuan, Shanxi 030051, China
²Department of Mathematics, North University of China, Taiyuan, Shanxi 030051, China

Correspondence should be addressed to Yubin Gao; ybgao@nuc.edu.cn

Received 24 February 2020; Accepted 23 June 2020; Published 16 July 2020

Academic Editor: Jean Jacques Loiseau

Copyright © 2020 Yajing Wang and Yubin Gao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Spectral graph theory plays an important role in engineering. Let be a simple graph of order with vertex set . For , the degree of the vertex , denoted by , is the number of the vertices adjacent to . The arithmetic-geometric adjacency matrix of is defined as the matrix whose entry is equal to if the vertices and are adjacent and 0 otherwise. The arithmetic-geometric spectral radius and arithmetic-geometric energy of are the spectral radius and energy of its arithmetic-geometric adjacency matrix, respectively. In this paper, some new upper bounds on arithmetic-geometric energy are obtained. In addition, we present the Nordhaus–Gaddum-type relations for arithmetic-geometric spectral radius and arithmetic-geometric energy and characterize corresponding extremal graphs.

1. Introduction

Spectral properties of graphs have been widely applied in the field of engineering technology. In systems engineering, complex networks are often used as abstract models to study and reveal the relationship among system elements. The mathematical study of complex network depends on graph theory. In network dynamics, the analysis of threshold in the epidemic model and synchronization condition of coupling oscillators is essentially the study of spectral of the corresponding graph. Naturally, the development of systems engineering depends on the results and conclusions of basic studies in graph spectral theory. Similarly, in the chemical engineering, a chemical molecule can also be abstracted as a graph. The combinatorial forms of spectral of weighted graphs, based on topological indices, are closely related to the molecular orbital energy levels of -electrons in conjugated hydrocarbons, as well as the spectrum properties. The combinatorial form of the spectrum, significantly correlated with the stability of conjugated alternant molecules, is defined as the sum of the absolute values of the eigenvalues of graphs. In this paper, we further study the arithmetic-geometric spectral radius and arithmetic-geometric energy.

Let be a simple graph with vertex set and edge set , and let . An edge with end vertices and is denoted by . The degree of the vertex of for is denoted by . Let and represent the maximum and minimum degrees of , respectively. The graph is called the complement to the graph G, if its vertex set is the same as , and and are adjacent in if and only if they are not adjacent in .

The adjacency matrix of a graph is the matrix , denoted by , where if and are adjacent; if not, . All eigenvalues of are denoted by the nonincreasing sequence . The spectral radius of is the greatest eigenvalue . The energy of is defined as

As a graph invariant, topological indices are used to understand physicochemical properties of chemical compounds since they capture some properties of molecules. In 2015, the paper [1] proposed the arithmetic-geometric index of a graph and defined the arithmetic-geometric adjacency matrix (AG matrix) of , denoted by . An element of AG matrix is defined in the following manner:

The AG eigenvalues of are the eigenvalues of its corresponding AG matrix. Note that AG matrix is real and symmetric so that all eigenvalues of are real, which can be recorded as . Similarly, the greatest AG eigenvalue is called the arithmetic-geometric spectral radius (AG spectral radius) of . In addition, the arithmetic-geometric energy (AG energy) of is defined in an analogue way as

The first Zagreb index is a kind of important topological indices, which is defined in [2] as

A graph is said to be strongly regular with parameters if it is regular, every pair of adjacent vertices has common neighbors, and every pair of distinct nonadjacent vertices has common neighbors [3]. If , then is a disjoint union of complete graphs, whereas if and is noncomplete, then the eigenvalues of are (the trivial eigenvalue) and the roots and (the nontrivial eigenvalues) of the quadratic equation:

It is straightforward to show that the complement of a strong regular graph with parameters is still a strong regular graph with parameters . Recently, some bounds on AG spectral radius and AG energy were obtained in a couple of papers [4, 5]. Until now, hundreds of such “energy” have been introduced, such as inverse sum index energy [6], distance energy [7, 8], ABC energy [9, 10], matching energy [11, 12], and Randić energy [13, 14]. Recently, there are many studies, such as [15–17], on the energy of graphs with given parameters.

In the paper of Nordhaus and Gaddum [18], the lower and upper bounds on and were given, where and were the chromatic number of a graph and its complement , separately. Since then, in terms of an invariant of graph , any bound on or is referred to as a Nordhaus–Gaddum-type inequality or relation. And Nordhaus–Gaddum-type relations have received wide attention (e.g., [19]).

We write if the graphs and are isomorphic. As usual, let denote the complete graph of order and the complete multipartite graph, having vertices in the th partite set for each . Thus, , where . For other undefined notions and terminologies from graph theory, the readers are referred to [20, 21]. The rest of the paper is structured as follows: in Section 2, we give some useful lemmas; in Section 3, we get some new bounds on the AG energy; and in Sections 4 and 5, we obtain the Nordhaus–Gaddum-type relations for the AG spectral radius and AG energy of graph , respectively.

2. Preliminaries

Lemma 1. (see [22]). If is an real symmetric matrix with eigenvalues , then for any , . Equality holds if and only if is an eigenvector of corresponding to .

Lemma 2. (see [23]). Let be a graph of order and size with maximum degree and minimum degree . Then,

with equality holding if and only if is regular, a star plus copies of , or a complete graph plus a regular graph with a smaller degree of vertices.

Lemma 3. (see [5]). Let be a graph of order with the maximum degree and minimum degree . Then,

with equality holding if and only if is regular.

Lemma 4. (see [5]). Let be a graph of order . Then,

with equality holding if and only if is regular.

Lemma 5. (see [24]). A connected graph of order has only one positive eigenvalue in its adjacency spectrum if and only if is a complete multipartite graph.

3. On AG Energy of a Graph

Lemma 6. Let be a graph of order and size , then

equality holds if and only if is a regular graph.

Proof. Let us take any unit vector in . By Lemma 1, we have

Taking into (10), we have

then (9) holds.
For the equality in (9) to hold, all the inequalities in the above argument must be equalities. From (10), we have . Then, is a regular graph.
Conversely, if is regular, then . So is an eigenvector of corresponding to the eigenvalue . Then, the equality holds in (9).

Theorem 1. Let be a graph of order and size , then

with equality holding if and only if is isomorphic to a regular complete multipartite graph or .

Proof. Applying Lemma 6, we have

The first equality attained if and only if has at most one positive AG eigenvalue, and the second equality holds if and only if is regular. If has no positive eigenvalue, then . If has only one positive eigenvalue, from Lemma 5, then is isomorphic to a complete multipartite graph. And, if is a regular graph, then its AG matrix is identical to its adjacency matrix. If so, we know that the equality in Theorem 1 holds if and only if is isomorphic to a regular complete multipartite graph, or .

Theorem 2. Let be a graph of order and size , and . Then,

where . This bound is achieved if is either , , or a noncomplete connected strongly regular graph with two nontrivial eigenvalues both with absolute value:

Proof. By Lemma 6, we have . Moreover, since

must hold, we have

Combining the above inequality with the Cauchy–Schwartz inequality, we can see that the following inequality is obvious:

Thus,

Since the function

reaches the maximum for , we see that must hold as well. In addition, if , then . From this fact and inequality (19), it immediately follows that inequality (14) holds when .
It is obvious that and we know that if is either , , or a noncomplete connected strongly regular graph, the inequality holds. As the graph is regular, its AG matrix is the same as its adjacency matrix. That is to say, the AG eigenvalues for are (both with multiplicity ). Similarly, the AG eigenvalues for are (multiplicity 1) and (multiplicity ) so that equality must hold in (14), if is isomorphic to or .
Moreover, if is a noncomplete connected strongly regular graph with the trivial eigenvalue and other two nontrivial eigenvalues both with absolute value , the equality holds in (14) as well.

Remark 1. The paper [4] proved that if is a simple graph of order and size having no isolated vertices, then the following bound must hold:

The reason is following: defined in the proof of Theorem 2 reaches the maximum for , and the maximum is . It follows that

must hold. Moreover, . Hence, inequality (14) is an improvement on the bound in [4].

Theorem 3. If and is a graph on vertices with edges, then

where is the graph obtained from by deleting all isolated vertices. Equality holds if and only if .

Proof. It is easy to know that has at least isolated vertices if . We can obtain a graph with no isolated vertices by removing all isolated vertices. It follows that has at most vertices. Hence, by applying inequality (22) to , we can immediately see that

Moreover, equality holds if and only if ; that is, is the disjoint union of edges.

Theorem 4. Let be a graph of order and size and . Then,

holds. If is a strongly regular graph with parameters , the bound is achieved.

Proof. It is obvious that . If , then the inequality (14) is as follows:

Using routine calculus, it is seen that the left-hand side of inequality (26)—considered as a function of —is maximized when

holds. Inequality (25) now follows by substituting this value of into (26).
If , then by inequality (22) and , we know that

Since , then it is clear that (25) follows. Moreover, it follows by Theorem 2 that if is a strongly regular graph with parameters , equality holds in (25), which means that the upper bound is achieved. The theorem follows.

4. Nordhaus–Gaddum-Type Relation for AG Spectral Radius

Let , , and be the maximum degree, minimum degree, and spectral radius of the complement graph of , respectively. Here, we are presenting the lower and upper bounds on .

Theorem 5. Let be a graph of order . Then,

and the equality holds if and only if is a regular graph.

Proof. The proof of inequality in (29) follows directly from Lemma 4.
If the equality in (29) holds, that is, and , then by Lemma 4, is regular.
If is a regular graph, then

This finishes the proof.

Theorem 6. Let be a graph of order . Then,

with equality holding if and only if is a regular graph.

Proof. Lemma 6 gives that

where denotes the number of edges in . Then, we have

From Lemma 6, equality holds if and only if is isomorphic to a regular graph.

Theorem 7. Let be a connected graph of order and size . And we write the number of vertices with by and the second largest degree of graph by :

(1)If or , then

(2)If and , then

Moreover, the bounds are sharp.

Proof. (1) Without loss of generality, let . Since , by Lemmas 2 and 3, we have

It clearly follows that has isolated vertices. Let be the graph obtained from by removing the isolated vertices. It is clear that , , and , so

The proof of the inequality (34) follows.
(2) Let and . It follows that and . From Lemmas 2 and 3, we have

Hence, the inequality (35) holds.
To show the sharpness of upper bounds in Theorem 7, we consider the following examples.

Example 1. Let be a star of order . That is to say, and . Then, is the union of an isolated vertex and a complete graph . We have

Example 2. Let be a regular graph. It is clear that is still a regular graph. We have

5. Nordhaus–Gaddum-Type Relation for AG Energy

In the following theorems, some lower and upper bounds for are obtained.

Theorem 8. Let be a connected graph of order and size and be all connected components of . Then,

where and are the number of vertices and edges in , respectively. Moreover, the equality holds if and only if is isomorphic to a regular complete multipartite graph, or .

Proof. Applying Theorem 1, we have

Hence, we can obtain

From Theorem 1, we know that equality is possible if and only if is isomorphic to regular complete multipartite graph, or . The complement of regular complete multipartite graph is the disjoint union of complete graphs of order , and is the complement graph of . If so, holds. Hence, the equality holds if and only if is isomorphic to a regular complete multipartite graph, or .

Theorem 9. Let be a graph of order and size , then

with equality holding if and only if either or .

Proof. Note that

Similar to the analysis of equality in Theorem 8, we consider the following two cases:

(1), which implies .(2)Both and are isomorphic to regular complete multipartite graphs. This is impossible because complete multipartite graphs are connected, whereas their complements are disconnected.

Theorem 10. Let be a graph of order and is the complement graph of . If both and have no isolated vertices, then

If is a strongly regular graph with parameters , the equality holds.

Proof. From Theorem 4, we have

If is a strongly regular graph, we know that is also a strongly regular graph. Moreover, all inequalities in the above argument must be equalities. The first equality holds if is isomorphic to a strongly regular graph with parameters . And, the last equality holds if is regular. The theorem now follows immediately.

6. Conclusions

In this paper, we obtain an upper bound on AG spectral radius, and furthermore, the Nordhaus–Gaddum-type relation of AG spectral radius is derived. Some new upper and lower bounds on arithmetic-geometric energy are obtained. Moreover, we illustrate one of the upper bounds is better than the result in paper [4]. In the end, we state the Nordhaus–Gaddum-type relation of AG energy.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This research was funded by the Shanxi Scholarship Council of China (no. 201901D211227).

References

V. Shegehalli and R. Kanabur, “Arithmetic-geometric indices of path graph,” Journal of Computer and Mathematical Sciences, vol. 6, no. 1, pp. 19–24, 2015.

I. Gutman and N. Trinajstić, “Graph theory and molecular orbitals. Total -electron energy of alternant hydrocarbons,” Chemical Physics Letters, vol. 17, no. 4, pp. 535–538, 1972.

C. Godsil and G. F. Royle, Algebraic Graph Theory, Springer, New York, NY, USA, 2001.

X. Guo and Y. B. Gao, “Arithmetic-geometric spectral radius and energy of graphs,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 83, no. 3, pp. 651–660, 2020.

L. Zheng, G. X. Tian, and S. Y. Cui, “On spectral radius and energy of arithmetic-geometric matrix of graphs,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 83, no. 3, pp. 635–650, 2020.

S. Hafeez and R. Farooq, “Inverse sum indeg energy of graphs,” IEEE Access, vol. 7, pp. 100860–100866, 2019.

X. Zhang, “Inertia and distance energy of line graphs of unicyclic graphs,” Discrete Applied Mathematics, vol. 254, pp. 222–233, 2019.

S. Pirzada, H. A. Ganie, B. A. Rather, and R. Ul Shaban, “On generalized distance energy of graphs,” Linear Algebra and Its Applications, vol. 603, pp. 1–19, 2020.

X. Chen, “On ABC eigenvalues and ABC energy,” Linear Algebra and Its Applications, vol. 544, pp. 141–157, 2018.

Y. Gao and Y. Shao, “The minimum ABC energy of trees,” Linear Algebra and Its Applications, vol. 577, pp. 186–203, 2019.

J. Zhu and J. Yang, “On the minimal matching energies of unicyclic graphs,” Discrete Applied Mathematics, vol. 254, pp. 246–255, 2019.

F. Ashraf, “Energy, matching number and odd cycles of graphs,” Linear Algebra and Its Applications, vol. 577, pp. 159–167, 2019.

K. C. Das and S. Sun, “Extremal graphs for Randić energy,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 77, no. 1, pp. 77–84, 2017.

I. Altındag, “Some statistical results on Randić energy of graphs,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 79, no. 2, pp. 331–339, 2018.

M. A. Bhat and S. Pirzada, “On unicyclic graphs with given number of pendent vertices and minimal energy,” Linear Algebra and Its Applications, vol. 597, pp. 86–93, 2020.

H. A. Ganie, U. Samee, S. Pirzada, and A. M. Alghamdi, “Bounds for graph energy in terms of vertex covering and clique numbers,” Electronic Journal of Graph Theory and Applications, vol. 7, no. 2, pp. 315–328, 2019.

H. A. Ganie, U. Samee, and S. Pirzada, “On graph energy, maximum degree and vertex cover number,” Le Matematiche, vol. 74, no. 1, pp. 163–172, 2019.

E. A. Nordhaus and J. W. Gaddum, “On complementary graphs,” The American Mathematical Monthly, vol. 63, no. 3, pp. 175–177, 1956.

M. Aouchiche and P. Hansen, “A survey of Nordhaus-Gaddum type relations,” Discrete Applied Mathematics, vol. 161, no. 4-5, pp. 466–546, 2013.

J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, UK, 1976.

X. Li, Y. Shi, and I. Gutman, Graph Energy, Springer, New York, NY, USA, 2012.

F. Zhang, “Basic results and techniques,” in Matrix Theory, Springer, New York, NY, USA, 2011.

D. Cao, “Bounds on eigenvalues and chromatic numbers,” Linear Algebra and Its Applications, vol. 270, no. 1–3, pp. 1–13, 1998.

J. H. Smith, “Some properties of the spectrum of a graph,” in Combinatorial Structures and Their Applications, pp. 403–406, Gordon and Breach, New York, NY, USA, 1970.