On the r-domination number of a graph
From MaRDI portal
Recommendations
Cites work
- R -Domination in Graphs
- A linear algorithm for the domination number of a tree
- Domination in graphs with minimum degree two
- Graphs with homeomorphically irreducible spanning trees
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4068901 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- Relations between packing and covering numbers of a tree
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning Trees with Many Leaves
Cited in
(15)- The rati of the irredundance and domination number of a graph
- On the domination number of a graph
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs
- Some new results on distance \(k\)-domination in graphs
- On the domination number of a graph defined by containment
- scientific article; zbMATH DE number 5844276 (Why is no real title available?)
- An algorithm for the inverse distance-2 dominating set of a graph
- scientific article; zbMATH DE number 4204373 (Why is no real title available?)
- scientific article; zbMATH DE number 5717271 (Why is no real title available?)
- scientific article; zbMATH DE number 1191211 (Why is no real title available?)
- r-domination problems on homogeneously orderable graphs
- scientific article; zbMATH DE number 1750102 (Why is no real title available?)
- Higher independence complexes of graphs and their homotopy types
- On Rall's 1/2-conjecture on the domination game
- On the L-Grundy domination number of a graph
This page was built for publication: On the \(r\)-domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197015)