Convex domination in the composition and Cartesian product of graphs.
From MaRDI portal
Publication:4909746
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (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
Cited in
(8)- Weakly convex and convex domination numbers of some products of graphs.
- Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
- Clique doubly connected domination in the join and lexicographic product of graphs
- Convex and isometric domination of (weak) dominating pair graphs
- The convex and weak convex domination number of convex polytopes
- On cliques and forcing \(m\)-convexity numbers of graphs.
- Convex dominating sets in maximal outerplanar graphs
- Characterization of the Cartesian product of complete graphs by convex subgraphs
This page was built for publication: Convex domination in the composition and Cartesian product of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909746)