Total perfect codes in tensor products of graphs.
From MaRDI portal
Recommendations
Cited in
(20)- Perfect codes in power graphs of finite groups
- Total perfect codes, OO-irredundant and total subdivision in graphs
- Efficient closed domination in digraph products
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- Total perfect codes in Cayley graphs
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- scientific article; zbMATH DE number 13195 (Why is no real title available?)
- scientific article; zbMATH DE number 1788315 (Why is no real title available?)
- Some properties on the disjunctive product over graphs of monogenic semigroups
- A Taxonomy of Perfect Domination
- Total perfect codes in graphs realized by commutative rings
- Perfect codes in proper reduced power graphs of finite groups
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Perfect codes in circulant graphs
- Total perfect codes in grid graphs
- Subgroup total perfect codes in Cayley sum graphs
- The perfect codes of non-coprime and coprime graphs
- Perfect codes in Cayley graphs of abelian groups
- Perfect codes and total perfect codes in intersection graphs of finite groups
- New characterization of efficient closed and open dominated graphs
This page was built for publication: Total perfect codes in tensor products of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070313)
