相关论文: On the Spectral properties of power graphs over ce…

The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…

The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…

The reduced power graph $\mathcal{RP}(G)$ of a group $G$ is the graph with vertex set $G$ and two vertices $u$ and $v$ are adjacent if and only if $\left\langle v\right\rangle \subset \left\langle u \right\rangle $ or $\left\langle…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…

In this paper we compute spectrum, Laplacian spectrum, signless Laplacian spectrum and their corresponding energies of commuting conjugacy class graph of the group $G(p, m, n) = \langle x, y : x^{p^m} = y^{p^n} = [x, y]^p = 1, [x, [x, y]] =…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

The directed power graph $\mathcal G(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ in which $x\rightarrow y$ if $y$ is a power of $x$, the power graph is the underlying simple graph, and the enhanced power…

The enhanced power graph of a group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if they belong to same cyclic subgroup. In this paper, we study distant properties and detour distant properties such as…

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…

Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x\rangle\subseteq \langle y\rangle$ or $\langle y\rangle\subseteq…

The power graph of a group $G$ is a graph with vertex set $G$, where two distinct vertices $a$ and $b$ are adjacent if one of $a$ and $b$ is a power of the other. Similarly, the enhanced power graph of $G$ is a graph with vertex set $G$,…

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…

The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power…

For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…

The {\em power index} $\Theta(\Gamma)$ of a graph $\Gamma$ is the least order of a group $G$ such that $\Gamma$ can embed into the power graph of $G$. Furthermore, this group $G$ is {\em $\Gamma$-optimal} if $G$ has order $\Theta(\Gamma)$.…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we…

In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.

We introduce the set $\mathcal{G}^{\rm SSP}$ of all simple graphs $G$ with the property that each symmetric matrix corresponding to a graph $G \in \mathcal{G}^{\rm SSP}$ has the strong spectral property. We find several families of graphs…