Abstract
Let G be a finite graph and \(\overline{G}\) be any graph covering over G. By applying the representation theory of symmetric groups, the Laplacian characteristic polynomial and the normalized Laplacian characteristic polynomial of \(\overline{G}\) are investigated. As applications, adopting the algebra method the Kirchhoff index, the multiplicative degree-Kirchhoff index and the complexity of any connected covering over a connected graph are derived.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(G=(V(G), E(G))\) be a finite graph with vertex set V(G) and edge set E(G), which may have multiple edges and loops. A homomorphism from a finite graph \(\overline{G}\) to G is a map that sends vertices to vertices, edges to edges, and preserves incidence. A homomorphism map \(\pi : \overline{G}\rightarrow G\) is a covering projection if it is surjection such that \(\pi |_{N(\overline{\nu })}:N(\overline{\nu })\rightarrow N(\nu )\) is a bijection for all vertices \(\nu \in V(G)\) and \(\overline{\nu }\in \pi ^{-1}(\nu )\), where \(N(\nu )\) denotes the neighborhood of the vertex \(\nu \). The graph \(\overline{G}\) is called a graph covering over G, and \(\overline{G}\) is a k-fold covering if \(\pi \) is k-to-one. As an important class of graphs, covering graphs have been studied in many literatures [5, 6, 15, 18]. Especially, Feng, Kwark and Lee discussed the characteristic polynomials of a graph covering in [6]. Deng et al. introduced the concept of ramified coverings over a digraph as a generalization of branched coverings and derived a decomposition formula for the adjacency characteristic polynomial of a ramified covering in [5].
The resistance distance, a novel distance function defined on graphs, is put forward by Klein and Randić [13]. The resistance distance between two vertices \(\nu _i\) and \(\nu _j\) of a connected graph G, denoted by \(r_{\nu _i\nu _j}(G)\), is the electrical resistance between \(\nu _i\) and \(\nu _j\) when placing a unit resistor on every edge and a battery is attached at \(\nu _i\) and \(\nu _j\). As an important branch of electrical circuit theory, the resistance distance has been much studied in Physics and Engineering. Consequently, analogous to distance-based graph invariants, various graph invariants based on resistance distance have been defined and investigated. In particular, the two most famous graph invariants are the Kirchhoff index and the multiplicative degree-Kirchhoff index. The Kirchhoff index of a connected graph G [13] is defined as the sum of resistance distances between all pairs of vertices of G, i.e.,
The Kirchhoff index is closely related to the spectrum on the Laplacian matrix of G with \(n(n\ge 2)\) vertices, that is \({\varvec{K}}{} f (G)=n\sum _{i=2}^{n}\frac{1}{\lambda _i}\), where \(0=\lambda _1< \lambda _2 \le \cdots \le \lambda _n\) are all eigenvalues of the Laplacian matrix of G [9]. Another related descriptor that incorporate the degree \(d_{\nu _i}\) of vertex \(\nu _i\in V(G)\) is the multiplicative degree-Kirchhoff index, introduced by Chen and Zhang [3] and defined as:
A lot of attention has been given in recent years to these two indices. They are currently researched in a good deal of literature; see the recent papers [7, 12, 17, 19], and the references cited therein.
The rest of the present paper is organized as follows. In Sect. 2, some auxiliary results are then given. In Sect. 3 based on the relationship between graph coverings and permutation voltage graphs, the Laplacian and the normalized Laplacian characteristic polynomials of any graph covering \(\overline{G}\) over a finite graph G are obtained. This is done by applying the representation theory of symmetric groups. As applications, the formulae for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the complexity of any connected graph covering over a connected graph are derived in Sect. 4.
2 Preliminary
We use the block diagonal sum \(A_1\oplus \cdots \oplus A_n\) or \(\oplus _{i=1}^nA_{i}\) for the block diagonal sum of some square matrices \(A_1, \ldots , A_n\) and we write as \(n\circ A\) for short when \(A_1=\cdots =A_n=A\). The Kronecker product\(A\otimes B\) of matrices A and B is considered as the matrix B having the element \(b_{ij}\) replaced by the matrix \(b_{ij}A\). \(\mathbf {I}_n\) denotes the identity matrix of order n.
In this section, we recall some known results which are needed in next two sections.
Suppose that \(\mathbb {C}\) is the complex field. The complex general linear group of degree r, denoted by \(GL(r, \mathbb {C})\), is the group of all \(r\times r\) invertible matrices over \(\mathbb {C}\) with respect to multiplication. Let H be a finite group. A representation\(\rho \) of the group H over the complex field \(\mathbb {C}\) is a homomorphism from H to \(GL(r, \mathbb {C})\), and r is also called the degree of the representation \(\rho \). If the representation \(\rho : H\rightarrow GL(r, \mathbb {C})\) sends each \(g\in H\) to a permutation matrix, then \(\rho \) is called the permutation representation of H.
Let \(S_k\) be the symmetric group on \([k]=\{ 1, 2, \ldots , k \}\). The permutation representation \(\mathbf {P}\) of \(S_k\) sends each \(g\in S_k\) to the \(k\times k\) permutation matrix \(\mathbf {P}_g=(p^{(g)}_{ij})\), where
Lemma 1
[16] Let \(S_k\) be the symmetric group on [k]. Suppose that \(\rho _1=\mathbf {I}_1, \rho _2, \ldots , \rho _s\) form a complete set of inequivalent irreducible representations of \(S_k\) and \(f_i\) is the degree of \(\rho _i\) for each \(i\in [s]\), where \(f_1=1\). Then, there exists a nonsingular matrix M such that for all \(g\in S_k\)
where for each \(i\in [s]\)\(m_i\) is the multiplicity of the inequivalent irreducible representation \(\rho _i\) in the permutation representation \(\mathbf {P}\) which is defined by Eq. (1).
Let \(G=(V(G), E(G))\) be a finite graph with \(V(G)=\{\nu _1, \nu _2, \ldots , \nu _n\}\). A digraph \(\overleftrightarrow {G}\) is obtained from the graph G by changing every edge of G to a pair of oppositely directed edges. We denote the directed edge from vertex \(\nu _i\) to vertex \(\nu _j\) as ordered pair \((\nu _i, \nu _j)\). By \(e^{-1}=(\nu _j, \nu _i)\), we mean the reverse directed edge to \(e=(\nu _i, \nu _j)\). The function \(\phi : E(\overleftrightarrow {G}) \rightarrow S_k\) is called a permutation voltage assignment on G if \(\phi (e)^{-1}=\phi (e^{-1})\) for each \(e\in E(\overleftrightarrow {G})\). The pair \((G, \phi )\) is called a permutation voltage graph. A derived graph\(G^\phi \) of \((G, \phi )\) is a graph with vertex set \(V(G^\phi )=V(G)\times [k]=\{(\nu _i, u)|\nu _i\in V(G), u\in [k]\}\), and \((\nu _i, u)\) and \((\nu _j, v)\) are adjacent if and only if \(e=(\nu _i, \nu _j)\in E(\overleftrightarrow {G})\) and \(v=\phi (e)u\). Gross and Tucker [8] showed that every k-fold covering \(\overline{G}\) over G is a one-to-one correspondence with some derived graph \(G^\phi \) of \((G, \phi )\).
The adjacency matrix of the graph G is written as \(\mathbf {A}_G=(a_{ij})_{n\times n}\), where \(a_{ij}\) equals to the number of edges between vertices \(\nu _i\) and \(\nu _j\) if \(i\ne j\), and otherwise, it equals to twice the number of loops. \(\mathbf {D}_G=diag(d_G(\nu _1),d_G(\nu _2),\ldots ,d_G(\nu _n))\) means the degree matrix of G, where the degree \(d_G(\nu _i)\) of the vertex \(\nu _i\) is the number of neighbors of \(\nu _i\) ( each loop at \(\nu _i\) contributes 2 units to the degree \(d_G(\nu _i)\) ). By \(\mathbf {L}_G=\mathbf {D}_G-\mathbf {A}_G\) and \(\mathfrak {L}_G=\mathbf {D}_G^{-\frac{1}{2}}\mathbf {L}_G\mathbf {D}_G^{-\frac{1}{2}}=\mathbf {I}_n-\mathbf {D}_G^{-\frac{1}{2}}\mathbf {A}_G\mathbf {D}_G^{-\frac{1}{2}}\), we denote the Laplacian matrix and the normalized Laplacian matrix of G, respectively. Note that the isolated vertex is not permitted in G in order to \(\mathfrak {L}_G\) can be well-defined. Let \(\widetilde{G}\) be a signed graph [10] whose underlying graph is the graph G and let \(\sigma : E(\widetilde{G})\rightarrow \{+, -\}\) be the sign function of \(\widetilde{G}\). The adjacency matrix of \(\widetilde{G}\) is the matrix \(\mathbf {A}_{\widetilde{G}}\) whose off-diagonal entries are \(\widetilde{a}_{ij}=d^{+}(\nu _i, \nu _j)-d^{-}(\nu _i, \nu _j)\) for \(i\ne j\), and whose diagonal entries are \(\widetilde{a}_{ii}=2d^{+}(\nu _i,\nu _i)-2d^{-}(\nu _i,\nu _i)\), where \(d^{\varepsilon }(\nu _i, \nu _j)(\varepsilon =+,-)\) is the number of edges between vertices \(\nu _i\) and \(\nu _j\) labeled \(\varepsilon \) (the number of loops, if \(i=j\)). \(\mathbf {L}_{\widetilde{G}}=\mathbf {D}_{G}-\mathbf {A}_{\widetilde{G}}\) and \(\mathfrak {L}_{\widetilde{G}}=\mathbf {D}_{G}^{-\frac{1}{2}}\mathbf {L}_{\widetilde{G}}\mathbf {D}_{G}^{-\frac{1}{2}}\) are the Laplacian matrix and the normalized Laplacian matrix of \(\widetilde{G}\). More results on signed graphs can be found in [11, 20].
Lemma 2
(The Matrix-Tree Theorem) [1, 4] If \(\mathbf {L}_G\) is the Laplacian matrix of a connected graph G, then the complexity \(\kappa (G)\) (the number of spanning trees in G) is
where \(\mathbf {L}_G(i)\) is the matrix obtained from \(\mathbf {L}_G\) by deleting its i-th row and i-th column.
Lemma 3
[1, 2] The resistance distance of a connected graph G between any pairs of the vertices \(\nu _i\) and \(\nu _j\) is
where \(\mathbf {L}_G(i,j)\) is the matrix obtained from the Laplacian matrix \(\mathbf {L}_G\) of G by deleting its i-th and j-th rows and columns.
According to the famous Matrix-Tree Theorem and Lemma 3, the Kirchhoff index of a connected graph G can be represented as:
Let \(\Phi _{\mathbf {L}}(G; x)=\det (x\mathbf {I}_n-\mathbf {L}_G)\) and \(\Phi _{\mathbf {\mathfrak {L}}}(G; x)=\det (x\mathbf {I}_n-\mathbf {\mathfrak {L}}_G)\) be the characteristic polynomials of the Laplacian matrix and the normalized Laplacian matrix of G, respectively.
Lemma 4
[17] Let G be a connected graph with \(n (n\ge 2)\) vertices. Then, the Kirchhoff index of G is given by
An analogy between the Kirchhoff and multiplicative degree-Kirchhoff indices is:
Lemma 5
[3] Let \(Spec_{\mathfrak {L}}(G)=\{0=\mu _1<\mu _2 \le \cdots \le \mu _n\}\) be the normalized Laplacian spectrum of a connected graph G with \(n (n\ge 2)\) vertices and m edges. Then, the multiplicative degree-Kirchhoff index of G is
3 The Laplacian and the Normalized Laplacian Characteristic Polynomials of Any k-Fold Covering
In this section, let G be a finite graph which multiple edges and loops are allowed, and \(\overline{G}\) a k-fold covering over G. Suppose that vertex set \(V(G)=\{\nu _1, \nu _2, \ldots , \nu _n\}\) and \(|E(G)|=m\). It is apparent that \(|V(\overline{G})|=kn\) and \(|E(\overline{G})|=km\). Furthermore, we can find a permutation voltage assignment \(\phi : E(\overleftrightarrow {G}) \rightarrow S_k\) on G and \(\overline{G}\) brings into correspondence with \(G^{\phi }\). Suppose \(\Gamma =\langle \phi (e)|e\in E(\overleftrightarrow {G})\rangle \) is the subgroup of \(S_{k}\) generated by \(\{\phi (e)|e\in E(\overleftrightarrow {G})\}\), whose elements act as permutation on the set [k]. For any \(g\in \Gamma \), the \(n \times n\) matrix \(\mathbf {A}_{g}=(a^{(g)}_{ij})\) is defined as:
It is easy to check that
Arrange the vertices of the graph covering \(\overline{G}\) into k blocks:
We consider the adjacency matrix \(\mathbf {A}_{\overline{G}}\), degree matrix \(\mathbf {D}_{\overline{G}}\), Laplacian matrix \(\mathbf {L}_{\overline{G}}\), and normalized Laplacian matrix \(\mathfrak {L}_{\overline{G}}\) of \(\overline{G}\) under this order.
Theorem 6
Let G be a finite graph (isolated vertex is excluded when the normalized Laplacian characteristic polynomial is considered). Suppose that \(\phi : E(\overleftrightarrow {G})\rightarrow S_{k}\) is a permutation voltage assignment on G and \(\Gamma =\langle \phi (e)|e\in E(\overleftrightarrow {G})\rangle \). \(\mathbf {P}\) is a permutation representation of \(\Gamma \) associated with the set [k] which is defined as Eq. (1). Let \(\rho _{1}=I_1, \rho _{2}, \ldots , \rho _{s}\) be all inequivalent irreducible representations of \(\Gamma \), and the multiplicity of \(\rho _{i}\) in \(\mathbf {P}\) and the degree of \(\rho _{i}\) be denoted by \(m_{i}\) and \(f_{i}\) for each \(i\in [s]\), respectively. The Laplacian and the normalized Laplacian characteristic polynomials of the k-fold covering \(\overline{G}\) over G associated with \(\phi \) can be decomposed to the follows:
and
where \(\mathbf {A}_g\) is given by Eq. (3).
Proof
Kwak and Lee [14] showed the adjacency matrix \(\mathbf {A}_{\overline{G}}\) of the k-fold covering \(\overline{G}\) is
From the definition of graph coverings, the degree matrix \(\mathbf {D}_{\overline{G}}\) of \(\overline{G}\) can be expressed as:
By Lemma 1, there exists a nonsingular matrix M such that for all \(g\in \Gamma \)
where \( \rho _1(g)=\mathbf {I}_1\).
Set \(T=\mathbf {I}_n\otimes M\), then we have
From Eq. (6), it is obtained that \(T^{-1}\mathbf {D}_{\overline{G}} T=(\mathbf {I}_n\otimes M^{-1})(\mathbf {D}_{G}\otimes \mathbf {I}_k)(\mathbf {I}_n\otimes M)=\mathbf {D}_{G}\otimes \mathbf {I}_k\) and notice that \(f_1=1\) and \(\sum _{i=1}^{s}m_if_i=k\). According to the above facts, it follows:
Thus, the Laplacian characteristic polynomial \(\Phi _{\mathbf {L}}(\overline{G};x)\) is obtained from Eq. (8).
Now, we consider the normalized Laplacian characteristic polynomial \(\Phi _{\mathfrak {L}}(\overline{G};x)\) of \(\overline{G}\). By Eq. (4), the normalized Laplacian matrix \(\mathfrak {L}_{G}\) of G can be written as:
Moreover, by using Eqs. (5) and (6), the normalized Laplacian matrix \(\mathfrak {L}_{\overline{G}}\) of \(\overline{G}\) can be expressed as:
Therefore, \(T^{-1}\mathfrak {L}_{\overline{G}} T\) takes the matrix \(\mathfrak {L}_{\overline{G}}\) to the following form applying Eq. (10):
Thus, the normalized Laplacian characteristic polynomial \(\Phi _{\mathfrak {L}}(\overline{G}, x)\) of \(\overline{G}\) is derived from above equation. \(\square \)
If both G and \(\overline{G}\) are connected, then we can obtain the following decomposition formulae immediately.
Corollary 7
Let G be a connected graph. Keeping the notation as in Theorem 6, then the Laplacian characteristic polynomial and the normalized Laplacian characteristic polynomial of any connected k-fold covering \(\overline{G}\) over G associated with a permutation voltage assignment \(\phi \) can be decomposed as:
and
Proof
By the representation theory of symmetric groups, it is easy to see \(\Gamma =S_k\) and \(m_1=1\) if \(\overline{G}\) is connected. The results hold from Theorem 6. \(\square \)
4 Some Applications
Let G be a connected graph. In this section, we apply algebraic method to consider the Kirchhoff index, the multiplicative degree-Kirchhoff index and the complexity of a connected k-fold covering \(\overline{G}\) over G.
The following lemma is obtained easily by Lemma 2:
Lemma 8
Let G be a connected graph with n vertices. Then, we have
and
Theorem 9
Let G be a connected graph with n vertices, and \(\overline{G}\) a connected k-fold covering over G associated with the permutation voltage assignment \(\phi \). \(\mathbf {P}\) is a permutation representation of \(S_k\) which is defined as Eq. (1). Let \(\rho _{1}=I_1, \rho _{2}, \ldots , \rho _{s}\) be all inequivalent irreducible representations of \(S_k\), and the multiplicity of \(\rho _{i}\) in \(\mathbf {P}\) and the degree of \(\rho _{i}\) are denoted by \(m_{i}\) and \(f_{i}\) for each \(i\in [s]\), respectively. Then, the Kirchhoff index of \(\overline{G}\) is
where \(M_i=\mathbf {D}_G\otimes \mathbf {I}_{f_i}-\Sigma _{g\in S_k}(\mathbf {A}_g\otimes \rho _i(g))\) for \(i\in [s]\backslash \{1\}\), and \(\mathbf {A}_g\) is given by Eq. (3).
Proof
Take \(h_i(x)=x\mathbf {I}_{nf_i}-\mathbf {D}_G\otimes \mathbf {I}_{f_i}+\Sigma _{g\in S_k}(\mathbf {A}_g\otimes \rho _i(g))\) for each \(i\in [s]\backslash \{1\}\), then Eq. (11) can be rewritten as \(\Phi _{\mathbf {L}}(\overline{G};x)= \Phi _{\mathbf {L}}(G;x)\Pi _{i=2}^s\det h_i(x)^{m_i}.\) Noting that \(\Phi _{\mathbf {L}}(G;0)=0\) and using Eq. (13), we have
Furthermore, combining Eqs. (13) and (14), it follows that
Notice that \(|V(\overline{G})|=nk\) and by Lemma 4, we obtain that
Set \(M_i=-h_i(0)=\mathbf {D}_G\otimes \mathbf {I}_{f_i}-\Sigma _{g\in S_k}(\mathbf {A}_g\otimes \rho _i(g))\) for \(i\in [s]\backslash \{1\}\), then it is easy to see
and
Since the multiplicity of the Laplacian eigenvalue 0 for the connected graph \(\overline{G}\) is 1, so we have \(\det M_i\ne 0\) for \(i\in [s]\backslash \{1\}\) by Eq. (11). Thus, by the above two equations, we get
This theorem is proved by Eqs. (17) and (19). \(\square \)
Let G be a connected graph with the permutation voltage assignment\(\phi : E(\overleftrightarrow {G}) \rightarrow S_2\), and \(\widetilde{G}\) a signed graph taking G as the underlying graph of it. Denote \(e_{ij}\) the edge connecting vertices \(\nu _i\) and \(\nu _j\). The sign function \(\sigma : E(\widetilde{G})\rightarrow \{+, -\}\) is defined as:
Then, the adjacency matrix \(\mathbf {A}_{\widetilde{G}}\) of \(\widetilde{G}\) can be expressed as \(\mathbf {A}_{\widetilde{G}}=\mathbf {A}_{(1)}-\mathbf {A}_{(12)}\). Thus, the Kirchhoff index of any connected 2-fold covering over G is as follows:
Corollary 10
Let G be a connected graph with n vertices, and \(\overline{G}\) a 2-fold connected covering over G associated with the permutation voltage assignment \(\phi \). Besides, let \(\widetilde{G}\) be a signed graph which the underlying graph is G and the sign function \(\sigma \) of it is given by Eq. (20). Then, the Kirchhoff index of \(\overline{G}\) can be expressed as:
where \(\mu _1, \mu _2, \ldots , \mu _n\) are all of Laplacian eigenvalues of \(\widetilde{G}\).
Proof
Notice that the permutation representation \(\mathbf {P}\) of \(S_2\) associated with \(\phi \) is equivalent to \(I_1 \oplus \rho _2\), where \(\rho _2((1))=1\) and \(\rho _2((12))=-1\), and the multiplicity of \(\rho _2\) in \(\mathbf {P}\) is 1. By using Theorem 9 the Kirchhoff index of \(\overline{G}\) is
The corollary holds by using Vieta formula. \(\square \)
Theorem 11
Let G be a connected graph with n vertices, and \(\overline{G}\) a connected k-fold covering over G associated with the permutation voltage assignment \(\phi \). \(\mathbf {P}\) is a permutation representation of \(S_k\) which is defined as Eq. (1). Let \(\rho _{1}=I_1, \rho _{2}, \ldots , \rho _{s}\) be all inequivalent irreducible representations of \(S_k\), and the multiplicity of \(\rho _{i}\) in \(\mathbf {P}\) and the degree of \(\rho _{i}\) are denoted by \(m_{i}\) and \(f_{i}\) for each \(i\in [s]\), respectively. Then the complexity of \(\overline{G}\) over G associated with \(\phi \) is:
where \(M_i=\mathbf {D}_G\otimes \mathbf {I}_{f_i}-\Sigma _{g\in S_k}(\mathbf {A}_g\otimes \rho _i(g)).\)
Proof
For one thing Eq. (15) holds, and for another thing by Lemma 8 we have
Note that \(\sum _{i=1}^sm_if_i=k\) and \(m_1=f_1=1\). Combining Eqs. (15) and (22), we obtain
\(\square \)
Finally, let us consider the multiplicative degree-Kirchhoff index of \(\overline{G}\) with the same method as Theorem 9.
Similar to the proof of Lemma 4, the following Lemma 12 is gained by applying Lemma 5.
Lemma 12
Let G be a connected graph with n vertices and m edges. Then we have
Lemma 13
Let G be a connected graph with n vertices and m edges. Then the multiplicative degree-Kirchhoff index can be expressed as:
Proof
It is easy to see
and
So, the proof is completed by Lemma 12. \(\square \)
Theorem 14
Let G be a connected graph with n vertices and m edges, and \(\overline{G}\) a connected k-fold covering over G associated with the permutation voltage assignment \(\phi \). \(\mathbf {P}\) is a permutation representation of \(S_k\) which is defined as Eq. (1). Let \(\rho _{1}=I_1, \rho _{2}, \ldots , \rho _{s}\) be all inequivalent irreducible representations of \(S_k\), and the multiplicity of \(\rho _{i}\) and the degree of \(\rho _{i}\) are denoted by \(m_{i}\) and \(f_{i}\) for each \(i\in [s]\), respectively. Then the multiplicative degree-Kirchhoff index of \(\overline{G}\) is
where \(N_i=\mathbf {I}_{nf_i}-\Sigma _{g\in S_k}(\mathbf {D}_{G}^{-\frac{1}{2}}\mathbf {A}_{g} \mathbf {D}_{G}^{-\frac{1}{2}}\otimes \rho _i(g))\) for each \(i\in [s]\backslash \{1\}\).
Proof
The proof of this theorem is similar to that of Theorem 9.
Set \(l_i(x)=(x-1)\mathbf {I}_{nf_i}+\Sigma _{g\in S_k}(\mathbf {D}_{G}^{-\frac{1}{2}}\mathbf {A}_{g} \mathbf {D}_{G}^{-\frac{1}{2}}\otimes \rho _i(g))\) for each \(i\in [s]\backslash \{1\}\). So, Eq. (12) can be rewritten as \(\Phi _{\mathfrak {L}}(\overline{G};x)= \Phi _{\mathfrak {L}}(G;x)\Pi _{i=2}^s\det l_i(x)^{m_i}.\) Noting that \(\Phi _{\mathfrak {L}}(G;0)=0\) and by Eq. (23), then
On the other hand, since \(\det \mathfrak {L}_G=0\), it follows that
Since \(|E(\overline{G})|=mk\), and Eqs. (25) and (26), we get
Let \(N_i=-l_i(0)=\mathbf {I}_{nf_i}-\Sigma _{g\in S_k}(\mathbf {D}_{G}^{-\frac{1}{2}}\mathbf {A}_{g} \mathbf {D}_{G}^{-\frac{1}{2}}\otimes \rho _i(g))\) for each \(i\in [s]\backslash \{1\}\). Similar to Eq. (19), we can obtain that
The theorem is proved by Eqs. (27) and (28). \(\square \)
Similar to the proof of Corollary 10, we get
Corollary 15
Let G be a connected graph with n vertices and m edges, and \(\overline{G}\) a connected 2-fold covering over G associated with the permutation voltage assignment \(\phi \). Suppose \(\widetilde{G}\) is a signed graph taking G as the underlying graph and the sign function \(\sigma \) of it is given by Eq. (20). Then, the multiplicative degree-Kirchhoff index of \(\overline{G}\) is
where \(\theta _1, \theta _2, \ldots , \theta _n\) are all of the normalized Laplacian eigenvalues of \(\widetilde{G}\).
References
Bapat, R.B.: Graph and Matrices. Universitext. Springer/Hindustan Book Agency, London/New Delhi (2010)
Bapat, R.B., Gutman, I., Xiao, W.J.: A simple method for computing resistance distance. Z. Naturforch 58a, 494–498 (2003)
Chen, H.Y., Zhang, F.J.: Resistance distance and the normalized Laplacian spectrum. Discrete Appl. Math. 155, 654–661 (2007)
Cvetkovič, D., Rowlinson, P., Simić, S.: An Introduction to the Theory of Graph Spectra. London Mathematical Society Student Texts. Cambridge University, London (2010)
Deng, A.P., Sato, I., Wu, Y.K.: Characteristic polynomials of ramified uniform covering digraphs. Eur. J. Comb. 28(4), 1099–1114 (2007)
Feng, R.Q., Kwak, J.H., Lee, J.: Characteristic polynomials of graph coverings. Bull. Aust. Math. Soc. 69, 133–136 (2004)
Feng, L.H., Yu, G.H., Liu, W.J.: Further result regarding the degree Kirchhoff index of graphs. Miskolc Math. Notes 15(1), 97–108 (2014)
Gross, J.L., Tucker, T.W.: Generating all graph coverings by permutation voltage assignments. Discrete Math. 18, 273–283 (1977)
Gutman, I., Mohar, B.: The quasi-Wiener and the Kirchhoff indices coincide. J. Chem. Inf. Comput. Sci. 36, 982–985 (1996)
Harary, F.: On the notion of balanced in a signed graph. Mich. Math. J. 2(1), 143–146 (1953)
Hou, Y.P., Li, J.S., Pan, Y.L.: On the Laplacian eigenvalues of signed graphs. Linear Multilinear Algebra 51(1), 21–30 (2003)
Huang, Q.Y., Chen, H.Y., Deng, Q.Y.: Resistance distances and the Kirchhoff index in double graphs. J. Appl. Math. Comput. 50(1), 1–14 (2014)
Klein, D.J., Randić, M.: Resistance distance. J. Math. Chem. 12, 81–95 (1993)
Kwak, J.H., Lee, J.: Characteristic polynomials of some graph bundles II. Linear Multilinear Algebra 32, 61–73 (1992)
Mizuno, H., Sato, I.: Characteristic polynomials of some graph coverings. Discrete Math. 142, 295–298 (1995)
Serre, J.P.: Linear Representations of Finite Group. Springer, New York (1977)
Shi, L.Y., Chen, H.Y.: Resistance distance and Kirchhoff index of graphs with an involution. Discrete Appl. Math. 215, 185–196 (2016)
Stark, H.M., Terras, A.A.: Zeta functions of finite graphs and coverings. Adv. Math. 121, 124–165 (1996)
Yang, Y.J., Klein, D.J.: Resistance distance-based graph invariants of subdivisions and triangulations of graphs. Discrete Appl. Math. 181, 260–274 (2015)
Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4, 47–74 (1982)
Acknowledgements
This project was supported by the National Natural Science Foundation of China (No. 11571101). The authors are grateful to the anonymous referees for their valuable comments and helpful suggestions, which have considerably improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Xueliang Li.
Rights and permissions
About this article
Cite this article
Li, D., Hou, Y. Laplacian of a Graph Covering and Its Applications. Bull. Malays. Math. Sci. Soc. 42, 2569–2583 (2019). https://doi.org/10.1007/s40840-018-0617-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-018-0617-x
Keywords
- Graph covering
- Laplacian matrix
- Normalized Laplacian matrix
- Resistance distance
- Kirchhoff index
- Complexity