Perfect codes and total perfect codes in intersection graphs of finite groups
From MaRDI portal
Cites work
- Efficient dominating sets in Cayley graphs.
- Graph theory
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Independent perfect domination sets in Cayley graphs
- INTERSECTION GRAPH OF SUBMODULES OF A MODULE
- Intersection graphs of ideals of rings
- Intersection graphs of subgroups of finite groups
- Lattice-like total perfect codes
- On perfect codes in Cartesian products of graphs
- On subgroup perfect codes in Cayley graphs
- On the subgroup perfect codes in Cayley graphs
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Perfect codes in Cayley sum graphs
- Perfect codes in direct products of cycles
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes in graphs
- Perfect codes in proper reduced power graphs of finite groups
- Some results on the intersection graphs of ideals of rings
- Subgroup Perfect Codes in Cayley Graphs
- Subgroup perfect codes in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
- Sur deux propriétés des classes d'ensembles
- The clique number of the intersection graph of a finite group
- The graph of subgroups of a finite group
- Thickness of the subgroup intersection graph of a finite group
- Total perfect codes in tensor products of graphs.
This page was built for publication: Perfect codes and total perfect codes in intersection graphs of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288551)