Outer-convex domination in graphs
From MaRDI portal
Publication:5216447
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 1439489 (Why is no real title available?)
- scientific article; zbMATH DE number 2204178 (Why is no real title available?)
- Convex sets under some graph operations
- Convexity in graphs
- The outer-connected domination number of a graph
- Towards a theory of domination in graphs
Cited in
(10)- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- Outer-connected 2-dominating sets of graphs
- Convex domination in the composition and Cartesian product of graphs.
- Outer-\(k\)-connected component domination in graphs
- Outer-convex dominating set in the corona of graphs as encryption key generator
- Clique doubly connected domination in the join and lexicographic product of graphs
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- scientific article; zbMATH DE number 1124598 (Why is no real title available?)
- Outer-weakly convex domination number of graphs
- Inverse fair domination in the join and corona of graphs
This page was built for publication: Outer-convex domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216447)