Zobrazeno 1 - 10
of 347
pro vyhledávání: '"Ma Xuanlong"'
Publikováno v:
Open Mathematics, Vol 19, Iss 1, Pp 850-862 (2021)
The intersection power graph of a finite group GG is the graph whose vertex set is GG, and two distinct vertices xx and yy are adjacent if either one of xx and yy is the identity element of GG, or ⟨x⟩∩⟨y⟩\langle x\rangle \cap \langle y\rang
Externí odkaz:
https://doaj.org/article/3b33d0997ca442ac8997357f503c1c89
Publikováno v:
Open Mathematics, Vol 17, Iss 1, Pp 906-912 (2019)
For a finite noncyclic group G, let Cyc(G) be the set of elements a of G such that 〈a, b〉 is cyclic for each b of G. The noncyclic graph of G is a graph with the vertex set G ∖ Cyc(G), having an edge between two distinct vertices x and y if 〈
Externí odkaz:
https://doaj.org/article/7abe2aa6113c453da633407d3de869a9
Publikováno v:
Open Mathematics, Vol 15, Iss 1, Pp 1440-1449 (2017)
The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of th
Externí odkaz:
https://doaj.org/article/ce7816e4fe1c475589e75860ef6df589
For a digraph $\Gamma$, a subset $C$ of $V(\Gamma)$ is a perfect code if $C$ is a dominating set such that every vertex of $\Gamma$ is dominated by exactly one vertex in $C$. In this paper, we classify strongly connected 2-valent Cayley digraphs on a
Externí odkaz:
http://arxiv.org/abs/2310.19017
Autor:
Ma Xuanlong, Wang Kaishun
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 797-803 (2016)
For any positive integer k, let Ak denote the set of finite abelian groups G such that for any subgroup H of G all Cayley sum graphs CayS(H, S) are integral if |S| = k. A finite abelian group G is called Cayley sum integral if for any subgroup H of G
Externí odkaz:
https://doaj.org/article/32e5e5f77b9241a8af3548464708b616
Given a finite group $G$, the commuting graph of $G$ is the simple graph whose vertex set is $G$, and two distinct vertices are adjacent if they commute. In this paper, we classify all finite groups whose commuting graph is split and threshold. We al
Externí odkaz:
http://arxiv.org/abs/2305.07301
A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs on abelia
Externí odkaz:
http://arxiv.org/abs/2207.06743
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 article, w
Externí odkaz:
http://arxiv.org/abs/2207.05075
We determine the diameter of every connected component of the complement of the power graph and the enhanced power graph of a finite group, which completely answers two questions by Peter J. Cameron.
Comment: This paper has been accepted by the
Comment: This paper has been accepted by the
Externí odkaz:
http://arxiv.org/abs/2112.13499