scientific article; zbMATH DE number 3477211
From MaRDI portal
Publication:4060985
Cited in
(28)- Towards a theory of domination in graphs
- Some inequalities about connected domination number
- Irredundancy in circular arc graphs
- On minimum maximal independent sets of a graph
- Domination in fuzzy incidence graphs based on valid edges
- Disjoint independent dominating sets in graphs
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- A note on the independent domination number in graphs
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Distance irredundance and connected domination numbers of a graph
- Independent domination in regular graphs
- Independent strong weak domination: A mathematical programming approach
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS
- A Survey of the Game “Lights Out!”
- The rati of the irredundance and domination number of a graph
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Partial domination and irredundance numbers in graphs
- Independent domination in signed graphs
- Independent 2-point set domination in graphs - II
- An upper bound for the independent domination number
- Chordal graphs and upper irredundance, upper domination and independence
- A note on the independent domination number of subset graph
- The irredundance number and maximum degree of a graph
- On k-cost effective domination in the corona and lexicographic product of graphs and its variant
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Closed formulas for the independent (Roman) domination number of rooted product graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060985)
