On the independent domination number of regular graphs
From MaRDI portal
(Redirected from Publication:1929752)
Recommendations
- On independent domination number of regular graphs
- On independent domination of regular graphs
- Independent domination in regular graphs
- On the Independent Domination Number of Random Regular Graphs
- On domination and independence numbers of graphs
- scientific article; zbMATH DE number 734465
- A note on the independent domination number in graphs
- Domination versus independent domination in regular graphs
- Upper bounds for independent domination in regular graphs
- Independent dominating sets in regular graphs
Cites work
- A counterexample to conjecture of Barefoot, Harary, and Jones
- Disproof of a conjecture in the domination theory
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 30759 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- scientific article; zbMATH DE number 734465 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 786167 (Why is no real title available?)
- Independent domination in regular graphs
- Independent sets in regular graphs
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- Nordhaus--Gaddum bounds for independent domination
- On a Nordhaus-Gaddum type problem for independent domination
- On hitting all maximum cliques with an independent set
- On independent domination number of regular graphs
- On minimum maximal independent sets of a graph
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- The product of the independent domination numbers of a graph and its complement
- Towards a theory of domination in graphs
- Two relations between the parameters of independence and irredundance
- Upper bounds for independent domination in regular graphs
- What is the difference between the domination and independent domination numbers of a cubic graph?
Cited in
(37)- Independent domination in graphs: A survey and recent results
- Independent domination in bipartite cubic graphs
- Independent domination in subcubic graphs
- Independent domination of graphs with bounded maximum degree
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Bounds on domination parameters in graphs: a brief survey
- Domination versus independent domination in graphs of small regularity
- On independent domination in planar cubic graphs
- Independent domination in subcubic graphs of girth at least six
- A note on the independent domination number in graphs
- Independent domination in some wheel related graphs
- Cubic graphs with large ratio of independent domination number to domination number
- A note on the independent domination number of subset graph
- Graphs with equal domination and independent domination number
- Independent domination in cubic graphs
- Independent dominating sets in regular graphs
- Domination versus independent domination in cubic graphs
- On the independent domination number of the generalized Petersen graphs
- New bounds on the independence number of connected graphs
- scientific article; zbMATH DE number 7030865 (Why is no real title available?)
- Independent domination number in Cayley digraphs of rectangular groups
- An improved lower bound on the independence number of a graph
- A structural approach for independent domination of regular graphs
- Bounds on the independence number of a graph in terms of order, size and maximum degree
- On the Independent Domination Number of Random Regular Graphs
- Independent [1,2]-number versus independent domination number
- My favorite domination conjectures in graph theory are bounded
- Independent set dominating sets in bipartite graphs
- Conjectures of TxGraffiti: independence, domination, and matchings
- On independent domination of regular graphs
- Domination versus independent domination in regular graphs
- A tight bound for independent domination of cubic graphs without 4‐cycles
- Identifying codes in graphs of given maximum degree: characterizing trees
- Domination parameters and the removal of matchings
- Dominating induced matchings and other graph parameters
- On the ratio of the domination number and the independent domination number in graphs
- Independent domination in subcubic bipartite graphs of girth at least six
This page was built for publication: On the independent domination number of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929752)
