Complexity
Volume 2021 (2021), Article ID 7671212, 6 pages
https://doi.org/10.1155/2021/7671212

Research Article

Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph

Chun-Li Kan,¹ Ying-Ying Tan,¹ Jia-Bao Liu,¹ and Bao-Hua Xing²

¹School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
²School of Mathematics and Physics, Anqing Normal University, Anqing 246011, China

Correspondence should be addressed to Ying-Ying Tan; tansusan1@ahjzu.edu.cn and Jia-Bao Liu; liujiabaoad@163.com

Received 21 April 2021; Accepted 15 June 2021; Published 29 June 2021

Academic Editor: Huihua Chen

Copyright © 2021 Chun-Li Kan et al. 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.

In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique-inserted graph of a strongly regular graph. And, clique-inserted graph of the triangular graph , which is a strongly regular graph, is enumerated.

1. Introduction

Gutman in [1] officially gave the definition of graph energy, which has a widespread application in chemistry and physics [1–3]. Koolen and Moulton in [4] proved that the graph with maximal energy is a strongly regular graph. Furthermore, Haemers in [5] show that the maximal energy of strongly regular graphs is corresponding to a type of Hadmada matrix. Zhang in [6] suggested that the iterative operation of clique-insertion can be considered as a way to extend complex networks. It is meaningful to calculate some indices of clique-inserted graph of a strongly regular graph.

Algebraic graph theory, as a part of graph theory, mainly investigates the relationship between parameters and structure of a graph by matrix theory. The research on the spectrum of graph enriches graph theory. Collatz and Sinogowitz [7] firstly used adjacency matrix to study the spectrum and structure of graphs. However, many scholars gradually find that the adjacency spectrum has limitations, especially in solving the chemical problem of distinguishing isomers (i.e., homographs). Compared with adjacency matrix, Laplacian matrix can reflect the properties of graphs more accurately, see [8]. The Laplacian spectrum of a graph contributes to many invariants of a graph, such as Kirchhoff index and connectivity. These indices can further reflect some of the chemical properties of a graph. A tree of diameter 4 with minimum Laplacian spectral radius is determined in [9]. The properties of the Laplacian matrix and the application of the topological indices were studied in [10]. Cvetkovic’ et al. in [8] defined the signless Laplacian spectrum of finite graphs and their properties. With the further research on the internal characteristics of networks, some scholars have found that many actual networks are composed of several groups or clusters. These groups or clusters have relatively close connections among nodes, but relatively few connections between each cluster, which is called “community structure.” Revealing its community structure is very important for the analysis of network structure, and the community division method based on the graph spectrum effectively solves this problem.

The research on topological indices of graphs is a hot topic in graph theory. Many topological indices have applied in the field of chemistry and physics [11]. For an electrical network, the Kirchhoff index is proportional to the electrical energy consumed by the network per unit time [6]. Richard defines the Bruhat graph and gives the topological indices for it in [12]. From the perspective of complex networks, topological indices can reflect the overall characteristics [13], effectively evaluate the reliability of complex networks [14], protect useful networks, and block viral network [15]. The geometric arithmetic indices are proposed by Vukievic’ and Furtula in [16], which have a nice predictive ability to entropy, centrifugal factor, and other physical properties.

The paper is arranged as follows. We give some preliminaries and calculate spectrum of clique-inserted graph of a strongly regular graph in Section 2. In Section 3, we introduce some energies and typical topological indices. An example is given with respect to indices in Section 4.

2. Spectra of Clique-Inserted Graph of a Strongly Regular Graph

All graphs in this paper are simple and connected. A simple graph requires that there be neither a cycle nor a pair of vertices connected by two edges. Let be a graph whose vertices are . The adjacency matrix of is a square matrix of order , represented by . If vertices and are adjacent, then is 1 and 0, otherwise. The eigenvalues of a graph are the eigenvalues of the adjacency matrix , denoted by . Let be a diagonal matrix, and the diagonal elements are the degrees of the corresponding vertices of . The Laplacian matrix and the signless Laplacian matrix of are and , respectively. We denote the eigenvalues of by and the eigenvalues of by .

A graph with vertices is said to be k-regular if each of its vertices has degree . Furthermore, if any two adjacent vertices have a common neighbour and any pair of distinct nonadjacent vertices have common neighbour, then the graph is called a strongly regular graph with parameters . The strongly regular graph has exactly three eigenvalues: (because <0, we usually assume that <0) with where . The multiplicities and corresponding to and are given, respectively, by

By the property of the adjacency matrix, we have

The graph obtained by replacing every vertex of a graph by a clique (i.e., a complete graph) with vertices is called an s-clique-inserted graph of [17, 18]. Let be a vertex in whose degree is greater than 0. If we obtain by replacing the vertex with a 3-clique (as illustrated in Figure 1), then is said to a 3-clique-inserted graph at .

(a)

(b)

Figure 1: The 3-clique-inserted graph at vertex .

Next, we will calculate the spectrum of clique-inserted graph of a strongly regular graph. We firstly introduce a lemma before this.

Lemma 1 (see [19]). Let be an s-clique-inserted graph of a graph If the adjacency spectrum of is

then the adjacency spectrum of is

Let be a strongly regular graph; its parameters and spectrum are and , respectively. And, is a clique-inserted graph of . We can see that is a regular graph with degree . By Lemma 1, we conclude that the adjacency spectrum of is . The eigenvalues of , denoted by , are
For the regular graph , we have . Then, we obtain that the Laplacian eigenvalues of are So, the Laplacian spectrum of is By , the signless Laplacian eigenvalues of are The signless Laplacian spectrum of is {}. Then, we have the theorem as follows.

Theorem 1. Let be a strongly regular graph with parameters and adjacency spectrum is . If is a clique-inserted graph of , then the adjacency spectrum of is

the Laplacian spectrum of is

and the signless Laplacian spectrum of is

3. Applications of Spectra

In Section 2, we obtain the spectrum of . Now, we use the spectrum of to explore the corresponding other quantities. There are a lot of literature studies about the applications of spectrum of matrix, see [3, 9, 20, 21]. Some definitions will be given at first in each part.

3.1. Energy, Laplacian Energy, and Signless Laplacian Energy of

The energy of a graph is defined as the spectrum of adjacency matrix of graph which is put forward firstly by Gutman in [1]. The study of graph energy is one of the earliest and the most extensively studied in graph theory. The chemist Huckel obtained the graph model of the corresponding molecules through the approximate treatment of unsaturated hydrocarbons when he studied organic molecular energy. And, he used the eigenvalues of the corresponding matrix to represent the energy levels of specific electrons [8]. Graph energy has a strong application background in chemistry, such as establishing mathematical models for organic molecules and analysing energy levels and stability.

Let be a connected simple graph with vertices. Then the energy of is

Now we calculate the energy of . For , by Theorem 1, we have

By (2),

Substitute the values and in (1) into (10), we get

For , substitute the eigenvalue of into equation (8):

The energy of the graph is calculated from the spectrum of the adjacency matrix, and in algebraic graph theory, the Laplacian spectrum of graphs and the applications have also received extensive attention. Although the adjacency spectrum can reflect some properties of the graph, there are limitations, especially in the problem of the same spectrum. In [22], the Laplacian energy is used to propagate viruses in intuitionistic fuzzy networks. Cvetković et al. in [23] defined the signless Laplacian spectrum of finite graphs and their properties. Some scholars studied the maximization problem of the signless Laplacian spectrum of some special graphs [24, 25].

The Laplacian matrix adds degree matrix, a parameter closely related to graph structure, on the basis of adjacency matrix. The Laplacian spectrum has some properties of the adjacency spectrum. Let be the Laplacian eigenvalues of . And, the Laplacian energy is defined as

Let be the signless Laplacian eigenvalues of . The signless Laplacian energy is defined as

If is a regular graph with vertices and edges and degree we have Then, . So, for the clique-inserted graph , we have

3.2. Kirchhoff Index of

In the early research on the topological index of graphs, many scholars focused their attention on the ordinary graph distance. Until the rise of electrical network theory, D. J. Klein and M. Randi put forward the concept of the resistance distance of graphs in [26], which is a topology index defined by the resistance distance. This new distance function has been favoured by chemists since it was proposed. In the field of physics and engineering, the calculation of resistance between two points is the core problem of circuit theory research. In mathematics, various formulae for calculating resistance distance are produced one after another. For an electrical network, it is a direct proportion to the electrical energy consumed by the network per unit time [10]. The Kirchhoff index can be used to describe the structural characteristics of molecules and define the topological radius of polymers in chemistry [26]. Small value of Kirchhoff index means strong network robustness in network science [27, 28].

The Kirchhoff index and have the following relationship:

According to Theorem 1, substituting the Laplacian spectrum of into equation (16), we get the Kirchhoff index of :

3.3. The Number of Spanning Trees of

The number of spanning trees is a minimum connected subgraph that containing all vertices of the connected graph. It is also a measure of the structure of a graph. The spanning trees are used in network reliability analysis, circuit design in physics, self-organized criticality [29], and so on. In computer network, it is an important index to evaluate network security [30, 31]. In the router system, the whole router network can be regarded as a graph , all routers as vertex of graph , and the connection relationship between routers as edge of graph . When a vertex and its adjacent edges are removed from a graph , the less the number of spanning trees of the new graph, the more important the point is.

The number of spanning trees of a graph with order is defined as

We can determine the connectivity of the graph from the number of spanning trees . The larger the number is, the more connected the graph is, see [8]. There are two graphs in Figure 2. The left graph of Figure 2 is Petersen graph with Laplacian spectrum . The Laplacian spectrum of the right graph is . According to formula (16), we get of the left graph is 2000 and the right graph is 43. The connectivity in left graph is stronger than that in the right graph.

(a)

(b)

Figure 2: Which graph is best according to connectivity?.

According to Theorem 1, substitute the Laplacian spectrum of into formula (18), we obtain the number of spanning trees of is

4. An Example

In this section, we will give an example of calculations, that is, the clique-inserted graph of the triangular graph . The Johnson graph is also called the triangular graph (see Figure 3, for example, ).

Figure 3: A graph of

In [20], we know is a strongly regular graph with parameters and spectrum . Let be the clique-inserted graph of . Because , according to (10), the energy of is

By (17), the Kirchhoff index of is

By (19), the number of spanning trees of is

5. Conclusions

In this paper, we get the graph by applying the operation of clique insertion to a strongly regular graph and obtain the relationships between the adjacency spectrum of graph and . Furthermore, the Laplacian spectrum and signless Laplacian spectrum of are calculated. Based on the above conclusions, we give formulae expressing the energy, Kirchhoff index and the number of spanning trees of .

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by the foundation of Anhui Jianzhu University (no. 2018QD22).

References

I. Gutman, “Estimating the -electron energy of very large conjugated systems,” Die Naturwissenschaften, vol. 61, no. 5, pp. 216-217, 1974.

Z. Lukszo, E. Bompard, P. Hines, and L. Varga, “Energy and complexity,” Complexity, vol. 2018, Article ID 6937505, 2018.

J. B. Liu and X. F. Pan, “A unified approach to the asymptotic topological indices of various lattices,” Applied Mathematics and Computation, vol. 270, no. 8, pp. 62–73, 2015.

J. H. Koolen and V. Moulton, “Maximal energy graphs,” Advances in Applied Mathematics, vol. 26, no. 1, pp. 47–52, 2001.

W. H. Haemers, “Strongly regular graphs with maximal energy,” Linear Algebra and Its Applications, vol. 429, no. 11-12, pp. 2719–2723, 2008.

Z. H. Zhang, “Some physical and chemical indices of clique-inserted lattices,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2013, Article ID P10004, 2013.

L. V. Collatz and U. Sinogowitz, “Spektren endlicher grafen,” Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 21, no. 1, pp. 63–77, 1957.

M. CvetkovicM. Doob and H. Sachs, Spectral of Graphs and Applications, Academic Press, New York, NY, USA, 1980.

H. X. Zhang and Y. Wang, “The minimal Laplacian spectral radius of trees with diameter 4,” Theoretical Computer Science, vol. 657, no. 2, pp. 191–195, 2017.

J. B. Liu, J. D. Cao, A. Alofi, A. AL-Mazrooei, and A. Elaiw, “Applications of Laplacian spectra for n-prism networks,” Neurocomputing, vol. 198, pp. 69–73, 2016.

A. Jahanbani, R. Hasni, Z. B. Du, S. M. Sheikholeslami, and L. Guo, “Spectral properties with the difference between topological indices in graphs,” Journal of Mathematics, vol. 2020, Article ID 6973078, 10 pages, 2020.

E. Richard, “The number of spanning trees of the Bruhat graph,” Advances in Applied Mathematics, vol. 125, Article ID 102150, 2021.

T. Y. Nie, Z. Guo, K. Zhao, and Z. M. Lu, “Using mapping entropy to identity node centrality in complex networks,” Physica A-Statistical Mechanics and Its Applications, vol. 453, pp. 290–297, 2016.

X. Gao, K. Li, and B. Chen, “Invulnerability measure of a military heterogeneous network based on network structure entropy,” IEEE Access, vol. 6, pp. 6700–6708, 2018.

H. Aftab, N. Muhammad, N. Nafisa et al., “On topological indices for new classes of benes network,” Journal of Mathematics, vol. 2021, Article ID 6690053, 7 pages, 2021.

D. Vukićević and B. Furtula, “Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges,” Journal of Mathematical Chemistry, vol. 46, no. 4, pp. 1369–1376, 2009.

F. J. Zhang, Y. C. Chen, and Z. B. Chen, “Clique-inserted-graphs and spectral dynamics of clique-inserting,” Journal of Mathematical Analysis and Applications, vol. 349, no. 1, pp. 211–225, 2009.

H. Y. Chen and F. J. Zhang, “The critical group of a clique-inserted graph,” Discrete Mathematical and Theoretical Computer Science, vol. 319, pp. 24–32, 2014.

Y. Y. Tan, J. H. Koolen, and Z. J. Xia, “A spectral characterization of the s-clique extension of the triangular graphs,” Discussiones Mathematicae Graph Theory, vol. 40, no. 2, pp. 663–676, 2020.

J. B. Liu, X. F. Pan, J. D. Cao, and F. F. Hu, “A note on some physical and chemical indices of clique-inserted lattices,” Journal of Statistical Mechanics: Theory and Experiment, vol. 6, Article ID P06006, 2014.

S. W. Sun and K. C. Das, “Normalized Laplacian spectrum of complete multipartite graphs,” Discrete Applied Mathematics, vol. 284, pp. 234–245, 2020.

A. Kalimulla, R. Vijayaragavan, and S. S. Basha, “Virus spread in an intuitionistic fuzzy network based on Laplacian energy,” International Journal of Engineering, Science and Mathematics, vol. 8, no. 6, pp. 93–103, 2019.

D. Cvetković, P. Rowlinson, and S. K. Simić, “Signless laplacians of finite graphs,” Linear Algebra and Its Applications, vol. 423, no. 1, pp. 155–171, 2007.

M. L. Ye and Y. Z. Fan, “Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity,” Linear Algebra and Its Applications, vol. 433, no. 6, pp. 1180–1186, 2010.

J. M. Guo, J. Y. Ren, and J. S. Shi, “Maximizing the least signless Laplacian eigenvalue of unicyclic graphs,” Linear Algebra and Its Applications, vol. 519, pp. 136–145, 2017.

D. J. Klein and M. Randic, “Resistance distance,” Journal of Mathematical Chemistry, vol. 12, pp. 81–95, 1993.

C. Angeles, M. Margarida, and M. Enric, “Effective resistances and Kirchhoff index in subdivision networks,” Linear and Multilinear Algebra, vol. 65, no. 9, pp. 1823–1837, 2017.

X. Gao, Y. Luo, and W. Liu, “Resistance distances and the Kirchhoff index in Cayley graphs,” Discrete Applied Mathematics, vol. 159, no. 17, pp. 2050–2057, 2011.

D. Dhar, “Theoretical studies of self-organized criticality,” Physica A-Statistical Mechanics and Its Applications, vol. 369, no. 1, pp. 29–70, 2006.

S. Letina, T. F. Blanken, M. K. Deserno, and D. Borsboom, “Expanding network analysis tools in psychological networks: minimal spanning trees, participation coefficients, and motif analysis applied to a network of 26 psychological attributes,” Complexity, vol. 2019, Article ID 9424605, 27 pages, 2019.

Z. Z. Zhang, B. Wu, and F. Comellas, “The number of spanning trees in Apollonian networks,” Discrete Applied Mathematics, vol. 169, pp. 206–213, 2014.