The convex domination subdivision number of a graph
From MaRDI portal
(Redirected from Publication:5269921)
Recommendations
- Weakly convex domination subdivision number of a graph
- scientific article; zbMATH DE number 2149834
- Connected domination subdivision numbers of graphs
- On the total domination subdivision number in graphs
- On the total domination subdivision numbers in graphs
- On a conjecture concerning total domination subdivision number in graphs
- Domination subdivision and domination multisubdivision numbers of graphs
- Total domination subdivision numbers of graphs
- On the total domination subdivision number in some classes of graphs
- On two conjectures concerning total domination subdivision number in graphs
Cited in
(12)- Outer-convex dominating set in the corona of graphs as encryption key generator
- Convex dominating sets in maximal outerplanar graphs
- Nordhaus-Gaddum results for the convex domination number of a graph
- Connectivity index in vague graphs with application in construction
- Influence of edge subdivision on the convex domination number
- Graphs with convex domination number close to their order
- Total Roman domination subdivision number in graphs
- Outer-weakly convex domination number of graphs
- Weakly convex domination subdivision number of a graph
- Convex dominating-geodetic partitions in graphs
- A note on the weakly convex and convex domination numbers of a torus
- Triple Roman domination subdivision number in graphs
This page was built for publication: The convex domination subdivision number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269921)
