In [1], Kelarev and Quinn began studying the power graph of a finite semigroup. The directed power graph of a semigroup S, 𝒫(S), has vertex set as S. There is a directed edge from u to v if v is some power of u. The undirected power graph 𝒫(G) of a finite group G was introduced in [2]. 𝒫(G) has vertex set as G, and two vertices u and v are adjacent if and only if u = vm or v = un for some m,n. From [2], it is known that 𝒫(G) is always connected and it is complete if and only if G is a cyclic group of order 1 or pm where p is a prime number and m is a positive integer. In [3], it was proved that non-isomorphic finite groups may have isomorphic power graphs, but finite abelian groups with isomorphic power graphs must be isomorphic. Moreover, it was conjectured that two finite groups with isomorphic power graphs must have the same number of elements of each order. In [4], the conjecture was proved. In [5], several structural properties of power graph of finite groups have been studied. Various interesting results on the power graph of finite groups and semigroups have been studied in [6].
Given a simple graph 𝒢, the signless Laplacian matrix Q(𝒢) of 𝒢 is defined as Q(𝒢) = Deg (𝒢)+A(𝒢). Here, A(𝒢) is the adjacency matrix of 𝒢, and Deg (𝒢) is the diagonal matrix of vertex degrees. The signless Laplacian matrix (see [7-9]) Q(𝒢) has all its eigenvalues as non-negative. The set of eigenvalues of the adjacency matrix and signless Laplacian matrix of 𝒢 respectively form the adjacency, and signless Laplacian spectrum of 𝒢. Let λ1 ≤ λ2 ≤ ··· ≤ λk denote the eigenvalues of Q(𝒢) having multiplicities m1,m1,··· ,mk. Then the spectrum of Q(𝒢), denoted by σ(𝒢), is described as follows: \sigma(\mathcal{G})=\left(\begin{array}{ccccc} \lambda_1& \lambda_2& \cdots & \lambda_k \\ m_1& m_2& \cdots& m_k \end{array}\right). Thus, \sigma(K_n)=\left(\begin{array}{ccccc} 2(n-1)& n-2 \\ 1& n-1 \end{array}\right) for n≥2, where, Kn is the complete graph. The largest eigenvalue of Q is known as the Q-spectral radius of G. We shall denote the finite cyclic group by ℤn, the dihedral group by , the dicyclic group by DnDic4n, and the generalized quaternion group by Q_{2^{k+2}}. The Laplacian spectrum of and 𝒫(Dn) was studied in [10]. Various other structural properties of power graph of finite groups have been studied in [11-13]. For the past few years, scholars have been interested in studying the spectrum of graphs connected to algebraic structures in [14-19]. The adjacency spectra of power graph of various finite groups have been studied in [20]. In [21], Banerjee and Adhikari initiated the study of eigenvalues of the signless Laplacian matrix of . A recent survey on power graph of finite groups has been studied in [22].
The above works motivate us to calculate the signless Laplacian spectrum of the power graph of certain finite non-commutative groups. We compute the signless Laplacian spectrum of the power graph of elementary abelian groups of prime power order, Mathieu group M11, and Q_{2^{k+2}}. Finally, we provide bounds on the signless Laplacian spectral radius of 𝒫(Dic4n). In [23] and [24], some definitions of standard terms related to graph theory and group theory used in this paper have been given. Throughout the paper, the complement of a graph 𝒢 is denoted by 𝒢̅. The characteristic polynomial of a matrix M is denoted by \Theta(M;x).
The rest of this paper is organized as follows: In Section 2, we present some definitions and theorems. In Section 3, we provide some applications of studying the signless Laplacian spectrum of power graph of various finite groups in brief. We determine the eigenvalues of the signless Laplacian matrix of the power graph of elementary abelian group of order pn, and the smallest sporadic group M11, and the generalized quaternion group Q_{2^{k+2}}. Moreover, we provide lower and upper bounds on the largest eigenvalue of the signless Laplacian matrix of dicyclic group Dicn. In Section 4, we introduce the main contribution of the paper and also discuss some related work which can be considered for future research.
2
Preliminaries
In this section of the paper, we present some theorems and definitions used in this paper.
Definition 1
If G is a commutative group and all elements of G other than the identity element have the same order, then G is said to be an elementary abelian group.
If G is an elementary abelian group with identity element e, then for any element g(≠e) of G, the order of G will be p for some prime number.
Theorem 1
Suppose G is an elementary abelian group having order pn. If \ell=\frac{p^n-1}{p-1}, then the signless Laplacian spectrum of 𝒫(G) is given as follows:$$\sigma(\mathcal{P}(𝒢))=\left(\begin{array}{cccccccc}2p-3&&&\dfrac{\ell a^2+t+ \sqrt{a^4 \ell^2 - 2a^2 \ell t + 4a^2 \ell + t^2}}{2}&&&\dfrac{\ell a^2+t- \sqrt{a^4 \ell^2 - 2a^2 \ell t + 4a^2 \ell + t^2}}{2}\\\ell -1&&& 1 &&&1Here, a=\sqrt{p-1}, t=2p-3
Proof
Given \ell=\frac{p^n-1}{p-1}, using [25, Theorem 8], we find that 𝒫(G) is isomorphic to \mathcal{G}[K_1, \underbrace{K_{p-1},K_{p-1},\cdots, K_{p-1}}_{\ell \text{ times }}], where \mathcal{G}=K_1+\overline{K}_\ell. We note that 𝒢 has ℓ+1 vertices. If we denote the vertices of 𝒢 by {1,2,3,4,···,ℓ,ℓ+1}, then 𝒢 looks like in Figure 1.
Fig. 1
$1G=K_{1}+\bar{K}_{\ell}$
Definition 2
[26, Page 59] The dicyclic group of order 4n, denoted by Dic4n, is represented as follows:
If n, then Dic4n is known as the quaternion group. Moreover, if n = 2k for some natural number k, then Dic4n is known as the generalized quaternion group, and it is denoted by Q_{2^{k+2}}.
3
Applications
The signless Laplacian eigenvalues of a graph are associated to the graphs structural properties. In the case of graphs derived from algebraic structures such as power graph which has been studied in this paper, spectral analysis with regard to signless Laplacian matrix can help address a variety of algebraic structure-related concerns. Certain invariants related to graph connectivity and structure can also be derived from the signless Laplacian spectrum. The signless Laplacian spectrum can be used to study partitioning and cut problems in power graph of finite groups, where we are interested in separating a graph into subgraphs with minimal edge cuts.
3.1
Signless Laplacian spectrum of power graph of finite groups
Here, we shall determine the signless Laplacian spectrum of power graph of elementary abelian group, the smallest sporadic group M11, and the generalized quaternion group Q_{2^{k+2}}. From Definition 1 and Theorem 1, we note that N𝒢(i)={1} for all 2≤i≤ℓ+1. Moreover, N𝒢(i) = {2,3,4,···,ℓ,ℓ+1}. Thus, we observe that N_1=\sum_{i=2}^{\ell+1}(p-1)=\ell (p-1). Moreover, Ni = 1 for 2≤i≤ℓ+1. We further note that Kp–1 is a p–2 regular graph whose signless Laplacian eigenvalues are 2(p–2) having multiplicity 1 , and p–3 having multiplicity p–2.
We shall evaluate the above determinant using an inductive process. We define $\mathcal{M}_{(\ell+1) \times (\ell +1)}=\bigg(xI-C_{\mathcal{P}(𝒢)}\bigg)_{(\ell+1) \times (\ell +1)}$. Moreover, we shall obtain $\mathcal{M}_{\ell \times \ell}$ from $\mathcal{M}_{(\ell+1) \times (\ell +1)}$ from \mathcal{M}_{(\ell+1) \times (\ell +1)} by deleting the (ℓ+1)th row and column. Thus,
The matrices $\mathcal{M}_{(\ell-i) \times (\ell-i)}$ for $1\le i\le \ell-2$ for 1≤i≤ℓ–2 can be obtained along similar lines as shown above. Now, expanding \mathcal{M}_{(\ell+1) \times (\ell+1)} along the (ℓ+1)th row, we obtain,
The roots of x2–x(ℓa2+t)+a2ℓ(t–1)=0 are x^2-x(\ell a^2+t)+a^2\ell (t-1)=0.
Since the roots of \Theta(C_{\mathcal{P}(G)};x)=0 are 2p–3 having multiplicity ℓ–1 and having multiplicity 1, the result follows. We know that any finite simple group will be either cyclic, or alternating, or it will belong Lie groups, or else it is one of 26 exceptions known as the sporadic groups. Among the 26 sporadic groups, 5 were discovered by the famous mathematician Émile Léonard Mathieu in 1860. The smallest sporadic group M11, known as the Mathieu group of degree 11, has order 7920=24×32×5×11. For more information about M11, it has been presented in [28]. The graph 𝒫(M11) has been studied in detail in [29]. The structure of 𝒫(M11) has been depicted in [29, Figure 3].
Theorem 2
The signless Laplacian spectrum of the proper power graph of the sporadic group M11 is given as follows:
Here, α1,α2 are roots of the polynomial equation x2 – 21 x + 70 = 0, and β1, β2, β3, β4 are roots of the polynomial equation x4 – 52x3 + 849x2 – 5110x + 8232 = 0.
Proof
From [29], it is known that the 𝒫(M11) consists of 165 copies of a graph L, 55 copies of 𝒫(ℤ3), 396 copies of 𝒫(ℤ5), and 144 copies of 𝒫(ℤ11). All of them are connected to each other through the identity element of M11. Consequently, the proper power graph of M11 consists of 165 copies of L∗, 55 copies of 𝒫(ℤ2) copies of 𝒫(ℤ4), and 144 copies of 𝒫(ℤ10). The graph of L∗ is shown in Figure 2.
Fig. 2
The graph L∗.
Using [21, Theorem 3.1], we have sigma(\mathcal{P}(\mathbb{Z}_2))=\left(\begin{array}{ccccc} 2& 0 \\ 1& 1 \end{array}\right)$, and \sigma(\mathcal{P}(\mathbb{Z}_4))=\left(\begin{array}{ccccc} 6 & 2 \\ 1& 3 \end{array}\right). Moreover, using [21, Theorem 5.4], the signless Laplacian spectrum of 𝒫(ℤ10) is given as follows:
where p1, p2 are roots of the quadratic equation x2 – 21x + 70 = 0. Now, we find that L^{*}=\mathcal{G}_{L^{*}}[K_6, K_6, K_6, K_1, K_2,K_2,$ $K_2,K_2,K_2], where \mathcal{G}_{L^{*}} is of the following Figure 3.
Fig. 3
The graph \mathcal{G}_{L^{*}}$ for $L^{*} for L∗.
We have N_{\mathcal{G}_{L^{*}}}(i)=\{4\} for 1\le i\le 3$, $N_{\mathcal{G}_{L^{*}}}(i)=\{4,9\} for 1\le i\le 3$, $N_{\mathcal{G}_{L^{*}}}(i)=\{4,9\} and N_{\mathcal{G}_{L^{*}}}(9)=\{5,6,7,8\}
Here, n_1=n_2=n_3=6$, $n_4=1, n_5=n_6=n_7=n_8=n_9=2. Consequently, Ni = 1 for all 1 ≤ i ≤ 3, and Ni = 1 + 2 = 3 for all 5 ≤ i ≤ 8. Moreover, N4 = 6+6+6+2+2+2+2=26, and N9 = 2+2+2+2=8. Now, \sigma(K_6)=\left(\begin{array}{ccccc} 10 & 4 \\ 1& 5 \end{array}\right) and \sigma(K_2)=\left(\begin{array}{ccccc} 2& 0 \\ 1& 1 \end{array}\right). Thus, using [27, Theorem 2.1], the signless Laplacian eigenvalues of L∗ are 5 having multiplicity 15, 3 having multiplicity 4, 8 having multiplicity 1 , and rest are contained in the following:
Thus, the signless Laplacian spectrum of the proper power graph of M11 consists of 0 having multiplicity 55,2 having multiplicity 1243,3 having multiplicity 660,5 having multiplicity 2970,6 having multiplicity 396 , 7 having multiplicity 432,8 having multiplicity 785 , 11 having multiplicity 330, α1, α2 each having multiplicity 144 , and β1, β2, β3, β4 each having multiplicity 165 , where α1, α2 are roots of the polynomial equation x2 – x + 70 = 0, and β1, β2, β3, β4 are roots of the polynomial equation x4 – 52x3 + 849x2 – 5110x + 8232 = 0.
Theorem 3
The signless Laplacian spectrum of \mathcal{P}(Q_{8}) is given as follows:
where α1, α2 are roots of the cubic polynomial x3–8nx2+(16n2+8n–12)x–48n2+64n–16.
Proof
Using [30, Section 4.1], we find that \mathcal{P}(Q_{2^{k+2}}) is constructed from a copy of 𝒫(ℤ2n), and n copies of the complete graph K4, which share the identity element e of Q_{2^{k+2}}, and the element an known as the involution. Since n = 2k, hence using [2, Theorem 2.12], we find that 𝒫(ℤ2n) is the complete graph on 2n vertices. Thus, we have
\begin{flalign*} \mathcal{P}(Q_{2^{k+2}})=P_3[K_{2n-2},K_2, nK_2]. \end{flalign*}
Since the characteristic polynomial of C_{P_3} is x3–8nx2+(16n2+8n–12)x–48n2+64n–16, the result follows.
We now find the signless Laplacian spectrum of power graph of quaternion group.
Corollary 4
The signless Laplacian spectrum of 𝒫(𝒬8) is given as follows:
On putting n in 3 , we find that the signless Laplacian spectrum of 𝒫(𝒬8) consists of 4 having multiplicity 2,6 having multiplicity 1,2 having multiplicity 2 , and remaining eigenvalues are roots of the cubic polynomial x3–16x2+68x–80. Since x3–16x2+68x–80 = (x–2)(x–4)(x–10), the result follows.
3.2
Bounds on signless Laplacian spectral radius of power graph of dicyclic group
In the following theorem, we shall provide an upper bound and a lower bound on the Q-spectral radius of 𝒫(Dicn).
Theorem 5
If n≥3 is a positive integer, then the Q-spectral radius of 𝒫(Dicn) is bounded above by \dfrac{3n-6+\sqrt{8\alpha+n^2-4n+4}}{2}+2n+\sqrt{2n}. Moreover, the Q-spectral radius of 𝒫(Dicn) is bounded below by \dfrac{2\alpha+n-2+\sqrt{n^2-4\alpha ^2+4\alpha n-4n+4}}{2}. Here, α=ϕ(n)+1.
Proof
We note that 𝒫(Dic4n) consists of one copy of 𝒫(ℤ2n), and n copies of the complete graph K4, which contain the elements e and an of Dic4n.
We shall index the elements of 𝒫(Dic4n) in the following order:
We first list the elements e and an. We then list the remaining elements of ℤn namely \{a,a^2,a^3,\cdots,}, {a^{n-1},a^{n+1},\\ a^{n+2},\cdots, a^{2n-1}\
].
We then list the remaining elements of Dic4n in the following order:
\{b, a^nb,ab, a^{n+1}b, a^2b,a^{n+2}b,\cdots, a^{n-1}b, a^{2n-1}b\}.
Using the above indexing, the signless Laplacian matrix of 𝒫(Dic4n) is of the following form:
Using Schur complement determinant formula [31, Theorem 2.7.1], the matrix \begin{bmatrix} 0&& \mathcal{N}\\\mathcal{N}^T&& 0 \end{bmatrix} has characteristic polynomial as:
7a7b7c7d7d7d
Using 7 , we find that the spectrum of begin{bmatrix} 0&& \mathcal{N}\\\mathcal{N}^T&& 0 \end{bmatrix} consists of 0 having multiplicity 2n – 2 and \pm\sqrt{2n} having multiplicity 1 . Hence, the largest eigenvalue of \begin{bmatrix} 0&& \mathcal{N}\\\mathcal{N}^T&& 0 \end{bmatrix}$ is \sqrt{2n}. Therefore, using 6 and [32, Theorem 2.1], we obtain
It is quite trivial to note that the number of edges in 𝒫(Dicn) is greater than that in 𝒫(ℤn). Hence, using Interlacing Theorem [33, Theorem 7.8.13], we find that
Moreover, using [32, Theorem 2.2],
\begin{flalign*} \lambda_n(Q(\mathcal{P}(\mathbb{Z}_n)))\ge\dfrac{2\alpha+n-2+\sqrt{n^2-4\alpha ^2+4\alpha n-4n+4}}{2}. \end{flalign*}
Combining the two equations, we obtain,
\begin{flalign*} \lambda_n(Q(\mathcal{P}(\mathrm{ Dic}_n)))\ge \frac{2\alpha+n-2+\sqrt{n^2-4\alpha ^2+4\alpha n-4n+4}}{2}. \end{flalign*}
Hence, the result follows.
4
Conclusion and future work
The universal adjacency matrix of a graph 𝒢 denoted by 𝒰(𝒢) is defined as \mathcal{U}(\mathcal{G})=\alpha A(\mathcal{G})+\beta I+\gamma J+\delta \text{Deg}(\mathcal{G}), where α,β,γ,δ ∈ R and α ≠ 0,I is the identity matrix and J is the matrix all of whose entries are 1. It was introduced by Haemers and Omidi in [34] to unify the approach to study the spectral theories of the adjacency, Laplacian, and signless Laplacian spectra of graphs. Interested readers may determine the universal adjacency spectrum of power graph of various finite groups considered in this paper. Moreover, determining energy of graphs associated with algebraic structures has also attracted the attention of researchers over the last few decades, see for example [35] and [36]. The signless Laplacian spectrum of power graph of different finite non-commutative groups was examined in this research article. First, for elementary abelian groups whose orders are powers of a prime integer, we found the spectrum of the signless Laplacian matrix of the power graph. Next, we determined the signless Laplacian spectrum of the Mathieu group M11, which is the smallest sporadic group. Additionally, we got the signless Laplacian eigenvalues of \mathcal{P}(Q_{2^{k+2}}), where the generalized quaternion group is denoted by Q_{2^{k+2}}. At last, we established constraints on the signless Laplacian spectral radius of 𝒫(Dic4n), where Dic4n is the dicyclic group. We encourage the readers to determine the adjacency, Laplacian, and signless Laplacian energy of power graph of various finite groups considered in this paper.