New characterization of efficient closed and open dominated graphs
From MaRDI portal
Cites work
- An almost complete description of perfect codes in direct products of cycles
- Efficient domination and efficient edge domination: a brief survey
- Efficient open domination in Cayley graphs
- Efficient open domination in graph products
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Handbook of product graphs
- Hereditary efficiently dominatable graphs
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- scientific article; zbMATH DE number 4070305 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 3715623 (Why is no real title available?)
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 1156657 (Why is no real title available?)
- scientific article; zbMATH DE number 794265 (Why is no real title available?)
- Neighborhood structures and products of undirected graphs
- Odd neighborhood transversals on grid graphs
- On perfect codes in Cartesian products of graphs
- Perfect r-codes in lexicographic products of graphs.
- Perfect codes and independent dominating sets
- Perfect codes in direct graph bundles
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes in graphs
- Perfect domination in regular grid graphs
- The Kronecker Product of Graphs
- The square root of a graph
- Total perfect codes in grid graphs
- Total perfect codes in tensor products of graphs.
- Vizing's conjecture: a survey and recent results
This page was built for publication: New characterization of efficient closed and open dominated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323607)
