Connected domination subdivision numbers of graphs
From MaRDI portal
Recommendations
Cited in
(24)- Independent domination subdivision in graphs
- Block graphs with large paired domination multisubdivision number
- On the number of connected subgraphs of graphs
- Bounds on the connected domination number of a graph
- Domination and independence subdivision numbers of graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Total outer-connected domination subdivision numbers in graphs
- Connected domination stable graphs upon edge addition
- The connected hub number and the connected domination number
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- Connected domination
- Subdivisions, parity and well-covered graphs
- Effect of edge-subdivision on vertex-domination in a graph
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
- Total Roman domination subdivision number in graphs
- The convex domination subdivision number of a graph
- Connected edge domination in graphs
- scientific article; zbMATH DE number 5879563 (Why is no real title available?)
- Doubly connected domination subdivision numbers of graphs
- Bounding the total domination subdivision number of a graph in terms of its order
- Nordhaus-Gaddum type results for connected domination number of graphs
- Changing and unchanging of the connected domination number of a graph
- On the Roman domination subdivision number of a graph
- Total domination and total domination subdivision number of a graph and its complement
This page was built for publication: Connected domination subdivision numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620552)
