scientific article; zbMATH DE number 5080622
From MaRDI portal
Publication:3413877
Recommendations
- Efficient open domination in digraphs
- Efficient open domination in Cayley graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- scientific article; zbMATH DE number 4085682
- Efficient edge domination problems in graphs
- Efficient total domination in digraphs
- scientific article; zbMATH DE number 1151809
- Generalized domination and efficient domination in graphs
- Efficient domination in circulant graphs
Cited in
(20)- An algorithm for prescribed multiple domination in arbitrary graphs
- Perfect codes in power graphs of finite groups
- Existence of efficient total dominating sets of circulant graphs of degree 4
- On efficient dominating sets in simplicial graphs
- Partitioning the vertex set of G to make G H an efficient open domination graph
- Total perfect codes in Cayley graphs
- Odd and even dominating sets with open neighborhoods.
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- 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
- Efficient 2-domination in trees
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- On subgroup regular sets in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- Efficient sets in graphs
- Efficient sets in partial k-trees
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3413877)
