Connected domination subdivision numbers of graphs
From MaRDI portal
Publication:3620552
zbMATH Open1161.05055MaRDI QIDQ3620552FDOQ3620552
Authors: Odile Favaron, Hossein Karami, Seyed Mahmood Sheikholeslami 
Publication date: 14 April 2009
Recommendations
Cited In (22)
- The connected hub number and the connected domination number
- Domination and independence subdivision numbers of graphs
- On the number of connected subgraphs of graphs
- Effect of edge-subdivision on vertex-domination in a graph
- Bounds on the connected domination number of a graph
- Bounding the total domination subdivision number of a graph in terms of its order
- Title not available (Why is that?)
- Total domination and total domination subdivision number of a graph and its complement
- Block graphs with large paired domination multisubdivision number
- Independent domination subdivision in graphs
- Doubly connected domination subdivision numbers of graphs
- Total Roman domination subdivision number in graphs
- Total outer-connected domination subdivision numbers in graphs
- On the Roman domination subdivision number of a graph
- Connected edge domination in graphs
- The convex domination subdivision number of a graph
- Connected domination stable graphs upon edge addition
- Title not available (Why is that?)
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Subdivisions, parity and well-covered graphs
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
- Connected domination
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)
