- 1School of Mathematics and Statistics, Hexi University, Zhangye, China
- 2Institute of Intelligent Information, Hexi University, Zhangye, China
F, Hv are considered simple connected graphs on n and m + 1 vertices, and v is a specified vertex of Hv and u1, u2, … uk ∈ F. The graph G = G[F, u1, … , uk, Hv] is called a graph with k pockets, obtained by taking one copy of F and k copies of Hv and then attaching the ith copy of Hv to the vertex ui, i = 1, … , k, at the vertex v of Hv. In this article, the closed-form formulas of the resistance distance and the Kirchhoff index of G = G[F, u1, … , uk, Hv] are obtained in terms of the resistance distance and Kirchhoff index F and Hv.
1 Introduction
All graphs considered in this article are simple and undirected. The resistance distance between vertices u and v of G was defined by Klein and Randi
Definition 1. [11]: Let F, Hv be connected graphs, v be a specified vertex of Hv and u1, u2, … , uk ∈ F. Let G = G[F, u1, u2, … , uk, Hv] be the graph obtained by taking one copy of F and k copies of Hv and then attaching the ith copy of Hv to the vertex ui, i = 1, 2, … , k, at the vertex v of Hv(identify ui with the vertex v of the ith copy). Then, the copies of the graph Hv that are attached to the vertices ui, i = 1, 2, … , k are referred to as pockets, and G is described as a graph with k pockets.Barik [11] has described the Laplacian spectrum of G = G [F, u1, u2, … , uk, Hv] using the Laplacian spectrum of F and Hv in a particular case when deg(v) = m. Recently, Barik and Sahoo [12] have described the Laplacian spectrum of more such graphs’ relaxing condition deg(v) = m. Let deg(v) = l, 1 ≤ l ≤ m. In this case, we denoted G = G [F, u1, u2, … , uk, Hv] more precisely by G = G [F, u1, u2, … , uk; Hv, l]. When k = n, we denoted simply by G = G [F; Hv, l]. If deg(v) = l, 1 ≤ l ≤ m, let N(v) = {v1, v2, … , vl} ⊂ V(Hv) be the neighborhood set of v in Hv. Let H1 be the subgraph of Hv induced by the vertices in N(v) and H2 be the subgraph of Hv induced by the vertices which are in V(Hv)\(N(v) ∪ {v}). When Hv = H1 ∨ (H2 + {v}), we described the resistance distance and Kirchhoff index of G = G[F, u1, u2, … , uk, Hv]. The graphs F = C4 and H − v = C3 are considered. Taking l = 1, 2 and 3, we obtained graphs G1 = G1 [F; Hv, 1], G2 = G2 [F; Hv, 2], and G3 = G3 [F; Hv, 3], respectively. Figure 1 is referred. In this case, we described the resistance distance and Kirchhoff index of G = G [F; Hv, l] in terms of the resistance distance and Kirchhoff index of F and Hv. The results are contained in Section 3 of this article. Furthermore, when F = F1 ∨ F2, F1 is the subgraph of F induced by the vertices u1, u2, … , uk and F2 is the subgraph of F induced by the vertices uk+1, uk+2, … , un. The considered three graphs G2, G3, and G4 are shown in Figure 2, obtained from the two graphs F = K4 and Hv such that Hv \{v} = K3. It is observed that F = K1 ∨ K3, G2, G3, and G4 are graphs with 2, 3, and 4 pockets, respectively. Figure 2 can be referred. In this case, we described the resistance distance and Kirchhoff index of G[F, u1, u2, … , uk; Hv, l] in terms of the resistance distance and Kirchhoff index of F and Hv. These results are contained in Section 4.
2 Preliminaries
The {1}-inverse of M is a matrix X such that MXM = M. If M is singular, then it has infinite {1}-inverse [16]. For a square matrix M, the group inverse of M, denoted by M#, is the unique matrix X such that MXM = M, XMX = X, and MX = XM. It is known that M# exists if and only if rank(M) = rank(M2) [16, 17]. If M is really symmetric, then M# exists, and M# is a symmetric {1}-inverse of M. Actually, M# is equal to the Moore–Penrose inverse of M since M is symmetric [17].
It is known that the resistance distance in a connected graph G can be obtained from any {1}- inverse of G [13]. We used M(1) to denote any {1}-inverse of a matrix M, and (M)uv denotes the (u, v)-entry of M.
Lemma 2.1. [17]: Let G be a connected graph, then
Let 1n denote the column vector of dimension n with all the entries equal to one. We often use 1 to denote all-ones column vector if the dimension can be read from the context.
Lemma 2.2. [14]: For any graph, we have
Lemma 2.3. [18]: Let
be a nonsingular matrix. If A and D are nonsingular, then
where S = D − CA−1B.
Lemma 2.4. [15]: Let L be the Laplacian matrix of a graph of order n. For any a > 0, we have
Lemma 2.5. [5]: Let G be a connected graph on n vertices, then
Lemma 2.6. [19]: Let
be the Laplacian matrix of a connected graph. If D is nonsingular, then
is a symmetric {1}-inverse of L, where H = A− BD−1BT.
3 The Resistance Distance and Kirchhoff Index of G [F; Hv, l]
Let F be a connected graph with the vertex set {u1, u2, … , un}. Let Hv be a connected graph on m + 1 vertices with a specified vertex v and V(Hv) = {v1, v2, … , vm, v}. Let G = G[F; Hv, l]. It is noted that G has n(m + 1) vertices. Let deg(v) = l, 1 ≤ l ≤ m. With loss of generality, it is assumed that N(v) = {v1, v2, … , vl}. Let H1 be the subgraph of Hv induced by the vertices in {v1, v2, … , vl} and H2 be the subgraph of Hv induced by the vertices {vl+1, vl+2, … , vm}. It is supposed that Hv = H1 ∨ (H2 + {v}). In this section, we focused on determining the resistance distance and Kirchhoff index of G[F; Hv, l] in terms of the resistance distance and Kirchhoff index of F, H1 and H2.
Theorem 3.1. Let G [F; Hv, l] be the graph, as described previously. It is supposed that Hv = H1 ∨ (H2 + {v}). Let the Laplacian spectrum of H1 and H2 be σ(H1) = (0 = μ1, μ2, … μl) and σ(H2) = (0 = ν1, ν2, … νm−l). Then, G [F; Hv, l] has the resistance distance and Kirchhoff index as follows:
(i) For any i, j ∈ V(F), we obtained
(ii) For any i ∈ V(F) and j ∈ V(H1), we obtained
(iii) For any i ∈ V(F) and j ∈ V(H2), we obtained
(iv) For any i ∈ V(H1) and j ∈ V(H2), we obtained
(v) For any i ∈ V(H2) and j ∈ V(H1), we obtained
(vi) Let
Proof: Let
We began with the computation of {1}-inverse of the Laplacian matrix L(G) of G = G[F; Hv, l]. Let A = L(F) + lIn,
First, we computed the D−1. By Lemma 2.3, we obtained
so
By Lemma 2.3, we obtained
By Lemma 2.3, we obtained
Similarly,
where
so H# = L#(F). According to Lemma 2.6, we calculated − H#BD−1 and − D−1BTH#.
and
We are ready to compute the D−1BTH#BD−1.
Let
is a symmetric {1}-inverse of G[F; Hv, l], where
as stated in (i). For any i ∈ V(F) and j ∈ V(H1), by Lemma 2.1 and Eq. 1, we obtained
as stated in (ii). For any i ∈ V(F) and j ∈ V(H2), by Lemma 2.1 and Eq. 1, we obtained
as stated in (iii). For any i ∈ V(H1) and j ∈ V(H2), by Lemma 2.1 and Eq. 1, we obtained
as stated in (iv). For any i ∈ V(H2) and j ∈ V(H1), by Lemma 2.1 and Eq. 1, we obtained
as stated in (v). Now, we computed the Kirchhoff index of G[F; Hv, l]. By Lemma 2.5, we obtained Kf(G[F; Hv, l])
It is noted that the eigenvalues of (L(H2) + lIm−l) are 0 + l, ν2(H2) + l, … , νm−l(H2) + l and the eigenvalues of J(m−l)×(m−l) are (m − l), 0(m−l−1). Then,
Similarly,
It is easily obtained
Let
Let
Similarly,
4 Resistance Distance and Kirchhoff Index of G [F, u1, u2, … , uk; Hv, l]
In this section, we considered the case when F = F1 ∨ F2, where F1 is the subgraph of F induced by the vertices u1, u2, … , uk and F2 is the subgraph of F induced by the vertices uk+1, uk+2, … , un. In this case, we indicated the explicit formulae of the resistance distance and Kirchhoff index of G = G[F, u1, u2, … , uk; Hv, l] in terms of the resistance distance and Kirchhoff index of G and Hv.
Theorem 4.1. Let G = G [F, u1, u2, … , uk; Hv, l] be the graph, as described previously. Let σ(F1) = (0 = α1, α2, … αk), σ(F2) = (0 = β1, β2, … βn−k), σ(H1) = (0 = μ1, μ2, … μl), and σ(H2) = (0 = ν1, ν2, … νm−l). Then, G has the resistance distance and Kirchhoff index as follows:
(i) For any i, j ∈ V(F1), we obtained
(ii) For any i, j ∈ V(F2), we obtained
(iii) For any i, j ∈ V(H1), we obtained
(iv) For any i, j ∈ V(H2), we obtained
(v) For any i ∈ V(F) and j ∈ V(H1), we obtained
(vi) For any i ∈ V(F) and j ∈ V(H2), we obtained
(vii) For any i ∈ V(H1) and j ∈ V(H2), we obtained
(viii) For any i ∈ V(H2) and j ∈ V(H1), we obtained
(ix) Let
Proof: Let
where L1 = L(F1) + (n − k + l)Ik, L2 = L(F2) + kIn−k, L3 = (L(H1) + (m − l + 1)Il) ⊗ Ik, and L4 = (L(H2) + lIm−l) ⊗ Ik. Let A = L1,
First, we computed
By Lemma 2.3, we obtained
so
By Lemma 2.3, we obtained
Similarly,
where
so
and
We are ready to compute the D−1BTH#BD−1.
Let
is a symmetric {1}-inverse of G = G[F, u1, u2, … , uk; Hv, l], where
as stated in (i). For any i, j ∈ V(F2), by Lemma 2.1 and Eq. 7, we obtained
as stated in (ii). For any i, j ∈ V(H1), by Lemma 2.1 and Eq. 7, we obtained
as stated in (iii). For any i, j ∈ V(H2), by Lemma 2.1 and Eq. 7, we obtained
as stated in (iv). For any i ∈ V(F) and j ∈ V(H1) by Lemma 2.1 and Eq. 7, we obtained
as stated in (v). For any i ∈ V(F) and j ∈ V(H2), by Lemma 2.1 and Eq. 7, we obtained
as stated in (vi). For any i ∈ V(H1) and j ∈ V(H2), by Lemma 2.1 and Eq. 7, we obtained
as stated in (vii). For any i ∈ V(H2) and j ∈ V(H1), by Lemma 2.1 and Eq. 7, we obtained
as stated in (viii). Now, we computed the Kirchhoff index of
It is noted that the eigenvalues of (L(F1) + (n − k)Ik) are α1 + (n − k), α2 + (n − k), …, αk + (n − k). Then,
Similarly,
Similarly,
It is easily obtained that tr(Jl×(m−l) ⊗ Ik) = lk, tr(J(m−l)×l ⊗ Ik) = (m − l)k and tr(NTH#N) + tr(MTH#M) = tr(Jl×l⊗H#) + tr(J(m−l)×(m−l)⊗H#) = ltr(H#) + (m − l)tr(H#) = mtr(H#). Since
By the process of Theorem 4.1, we obtained
Similarly, 1T(MTH#M)1 = 0, 1TNTH#M1 = 0, and 1TMTH#N1 = 0.
Similarly, 1T(J(m−l)×l ⊗ Ik) = lk(m − l). Applying the aforementioned equations into
Data Availability Statement
The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding author.
Author Contributions
All the authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.
Funding
This work was supported by the National Natural Science Foundation of China (no. 61963013), the Science and Technology Plan of Gansu Province(18JR3RG206), and the Research and Innovation Fund Project of President of Hexi University(XZZD2018003).
Conflict of Interest
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Publisher’s Note
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.
References
2. Huang S, Zhou J, Bu C. Some Results on Kirchhoff index and Degree-Kirchhoff index. MATCH Commun Math Comput Chem (2016) 75:207–22.
3. Cao J, Liu J, Wang S. Resistance Distances in corona and Neighborhood corona Networks Based on Laplacian Generalized Inverse Approach. J Algebra Appl (2019) 18(3):1950053. doi:10.1142/s0219498819500531
4. Liu J-B, Pan X-F, Yu L, Li D. Complete Characterization of Bicyclic Graphs with Minimal Kirchhoff index. Discrete Appl Maths (2016) 200:95–107. doi:10.1016/j.dam.2015.07.001
5. Sun L, Wang W, Zhou J, Bu C. Some Results on Resistance Distances and Resistance Matrices. Linear and Multilinear Algebra (2015) 63(3):523–33. doi:10.1080/03081087.2013.877011
6. Bapat RB. Graphs and Matrices. London/New Delhi: Springer/Hindustan Book Agency (2010). Universitext.
7. Chen H, Zhang F. Resistance Distance and the Normalized Laplacian Spectrum. Discrete Appl Maths (2007) 155:654–61. doi:10.1016/j.dam.2006.09.008
8. Xiao W, Gutman I. Resistance Distance and Laplacian Spectrum. Theor Chem Acc Theor Comput Model (Theoretica Chim Acta) (2003) 110:284–9. doi:10.1007/s00214-003-0460-4
9. Yang Y, Klein DJ. A Recursion Formula for Resistance Distances and its Applications. Discrete Appl Maths (2013) 161:2702–15. doi:10.1016/j.dam.2012.07.015
10. Yang Y, Klein DJ. Resistance Distance-Based Graph Invariants of Subdivisions and Triangulations of Graphs. Discrete Appl Maths (2015) 181:260–74. doi:10.1016/j.dam.2014.08.039
11. Barik S. On the Laplacian Spectra of Graphs with Pockets. Linear and Multilinear Algebra (2008) 56:481–90. doi:10.1080/03081080600906463
12. Barik S, Sahoo G. Some Results on the Laplacian Spectra of Graphs with Pockets. Electron Notes Discrete Maths (2017) 63:219–28. doi:10.1016/j.endm.2017.11.017
13. Bapat RB, Gupta S. Resistance Distance in Wheels and Fans. Indian J Pure Appl Math (2010) 41:1–13. doi:10.1007/s13226-010-0004-2
14. Bu C, Yan B, Zhou X, Zhou J. Resistance Distance in Subdivision-Vertex Join and Subdivision-Edge Join of Graphs. Linear Algebra its Appl (2014) 458:454–62. doi:10.1016/j.laa.2014.06.018
15. Liu X, Zhou J, Bu C. Resistance Distance and Kirchhoff index of R-Vertex Join and R-Edge Join of Two Graphs. Discrete Appl Maths (2015) 187:130–9. doi:10.1016/j.dam.2015.02.021
16. Ben-Israel A, Greville TNE. Generalized Inverses: Theory and Applications. 2nd ed. New York: Springer (2003).
17. Bu C, Sun L, Zhou J, Wei Y. A Note on Block Representations of the Group Inverse of Laplacian Matrices. Electron J Linear Algebra (2012) 23:866–76. doi:10.13001/1081-3810.1562
19. Liu Q. Some Results of Resistance Distance and Kirchhoff index of Vertex-Edge corona for Graphs. Adv Mathematics(China) (2016) 45(2):176–83.
20. Liu J-B, Pan X-F, Hu F-T. The {1}-inverse of the Laplacian of Subdivision-Vertex and Subdivision-Edge Coronae with Applications. Linear and Multilinear Algebra (2017) 65:178–91. doi:10.1080/03081087.2016.1179249
21. Liu J-B, Cao J. The Resistance Distances of Electrical Networks Based on Laplacian Generalized Inverse. Neurocomputing (2015) 167:306–13. doi:10.1016/j.neucom.2015.04.065
22. Xie P, Zhang Z, Comellas F. On the Spectrum of the Normalized Laplacian of Iterated Triangulations of Graphs. Appl Maths Comput (2016) 273:1123–9. doi:10.1016/j.amc.2015.09.057
Keywords: resistance distance, Kirchhoff index, generalized inverse, Schur complement, generalized pockets
Citation: Liu Q and Li J (2022) Results on Resistance Distance and Kirchhoff Index of Graphs With Generalized Pockets. Front. Phys. 10:872798. doi: 10.3389/fphy.2022.872798
Received: 10 February 2022; Accepted: 14 March 2022;
Published: 23 June 2022.
Edited by:
Yongxiang Xia, Hangzhou Dianzi University, ChinaCopyright © 2022 Liu and Li. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Qun Liu, liuqun@fudan.edu.cn