Perfect codes in power graphs of finite groups
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 the group, in which two vertices are adjacent if the...
Main Authors: | Ma Xuanlong, Fu Ruiqin, Lu Xuefei, Guo Mengxia, Zhao Zhiqin |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-12-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2017-0123 |
Similar Items
-
A characterization of star-perfect graphs
by: G Ravindra, et al.
Published: (2024-03-01) -
On Perfectness of Intersection Graph of Ideals of ℤn
by: Das Angsuman
Published: (2017-12-01) -
On connected components and perfect codes of proper order graphs of finite groups
by: Huani Li, et al.
Published: (2024-02-01) -
Total perfect codes in graphs realized by commutative rings
by: Rameez Raja
Published: (2022-12-01) -
Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
by: Balbuena Camino, et al.
Published: (2021-11-01)