Degree equitable domination on graphs
From MaRDI portal
Publication:4897591
zbMATH Open1265.05473MaRDI QIDQ4897591FDOQ4897591
Authors: V. Swaminathan, Kupussamy Markandan Dharmalingam 
Publication date: 19 December 2012
Recommendations
equitable domination numberequitable independent setequitable isolateminimal equitable dominating set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cited In (21)
- Equitably strong nonsplit equitable domination in graphs
- EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS
- Novel applications of bipolar fuzzy graphs to decision making problems
- Equitable graph of a graph
- Equivalence dominating sets in graphs
- Equivalence domination in graphs
- Title not available (Why is that?)
- Complementary equitably totally disconnected equitable domination in graphs
- Secure equitability in graphs
- Degree equitable chromatic number of a graph
- A linear time algorithm for minimum equitable dominating set in trees
- THE GLOBAL EQUITABLE DOMINATION IN GRAPHS
- Equi independent equitable dominating sets in graphs
- Equitable domination in graphs
- Equitable fair domination in graphs
- Degree equitable restrained double domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Congruent Domination Number of Disjoint and One Point Union of Graphs
This page was built for publication: Degree equitable domination on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897591)
