Some inequalities about connected domination number
From MaRDI portal
(Redirected from Publication:1126207)
Recommendations
Cites work
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- A note on total domination
- Graph theory
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On Hadwiger's Number and the Stability Number
- Properties of Hereditary Hypergraphs and Middle Graphs
Cited in
(18)- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Connected domination number and a new invariant in graphs with independence number three
- scientific article; zbMATH DE number 2145745 (Why is no real title available?)
- A note on the domination inequalities and their applications
- scientific article; zbMATH DE number 4132214 (Why is no real title available?)
- Bounds on 2-point set domination number of a graph
- Distance irredundance and connected domination numbers of a graph
- A proof of a conjecture on the connected domination number
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- Making a dominating set of a graph connected
- Complexity of comparing the domination number to the independent domination, connected domination, and paired domination numbers
- An inequality on connected domination parameters
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- On the structure of graphs vertex critical with~respect to connected domination
- On the doubly connected domination number of a graph
- Relating the size of a connected graph to its total and restricted domination numbers
- Connected domination
- On connectivity numbers of stable domains
This page was built for publication: Some inequalities about connected domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126207)
