scientific article
From MaRDI portal
Publication:4060985
zbMATH Open0305.05114MaRDI QIDQ4060985FDOQ4060985
E. J. Cockayne, Stephen T. Hedetniemi
Publication date: 1974
Title of this publication is not available (Why is that?)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cited In (28)
- Towards a theory of domination in graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- Independent domination in regular graphs
- An upper bound for the independent domination number
- Chordal graphs and upper irredundance, upper domination and independence
- Independent strong weak domination: A mathematical programming approach
- Irredundancy in circular arc graphs
- The irredundance number and maximum degree of a graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- Distance irredundance and connected domination numbers of a graph
- Some inequalities about connected domination number
- Domination in fuzzy incidence graphs based on valid edges
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Partial domination and irredundance numbers in graphs
- On independent domination number of regular graphs
- Independent domination in signed graphs
- Independent 2-point set domination in graphs - II
- A note on the independent domination number of subset graph
- Disjoint independent dominating sets in graphs
- On the independent domination number of regular graphs
- A Survey of the Game “Lights Out!”
- A note on the independent domination number in graphs
- The rati of the irredundance and domination number of a graph
- Closed formulas for the independent (Roman) domination number of rooted product graphs
- On minimum maximal independent sets of a graph
- On k-cost effective domination in the corona and lexicographic product of graphs and its variant
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)
