Perfect codes in proper intersection power graphs of finite groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3682004 (Why is no real title available?)
- scientific article; zbMATH DE number 3724683 (Why is no real title available?)
- scientific article; zbMATH DE number 2031101 (Why is no real title available?)
- scientific article; zbMATH DE number 1522659 (Why is no real title available?)
- A survey of perfect codes
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Certain properties of the power graph associated with a finite group.
- Classification of Finite Groups with all Elements of Prime Order
- Directed graphs and combinatorial properties of semigroups
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs
- Finite groups whose intersection power graphs are toroidal and projective-planar
- Independent perfect domination sets in Cayley graphs
- On locally finite groups in which every element has prime power order
- On perfect codes in Cartesian products of graphs
- On the intersection power graph of a finite group
- On the structure of the power graph and the enhanced power graph of a group
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes in proper reduced power graphs of finite groups
- Perfect codes over graphs
- Power graphs: A survey
- Quotient graphs for power graphs
- Recent developments on the power graph of finite groups -- a survey
- Reduced power graph of a group
- Subgroup Perfect Codes in Cayley Graphs
- The cyclic graph (deleted enhanced power graph) of a direct product
- The power graph of a finite group
- The structure and metric dimension of the power graph of a finite group
- Undirected power graphs of semigroups
Cited in
(3)
This page was built for publication: Perfect codes in proper intersection power graphs of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996476)