The following pages link to Topics in Domination in Graphs (Q5146715):
Displaying 50 items.
- A note on double domination in graphs (Q2030253) (← links)
- On (1,2)-domination in cubic graphs (Q2043407) (← links)
- New bounds on the double total domination number of graphs (Q2064931) (← links)
- Local metric dimension for graphs with small clique numbers (Q2075516) (← links)
- Domination versus total domination in claw-free cubic graphs (Q2075530) (← links)
- Upper total domination in claw-free cubic graphs (Q2084795) (← links)
- Triangles and (total) domination in subcubic graphs (Q2115140) (← links)
- An improved upper bound on the independent domination number in cubic graphs of girth at least six (Q2115169) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- New bounds on the double domination number of trees (Q2133403) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Closed neighborhood ideals of finite simple graphs (Q2153126) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- Roman domination in direct product graphs and rooted product graphs (Q2671126) (← links)
- Multiple Domination (Q3384609) (← links)
- (Q4957549) (← links)
- Roman domination in oriented trees (Q4958049) (← links)
- A note on the k-tuple domination number of graphs (Q5037921) (← links)
- ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES (Q5068502) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- GLOBAL METRO DOMINATION OF GRAPHS (Q5076143) (← links)
- Nordhaus-Gaddum bounds for upper total domination (Q5089900) (← links)
- Paired domination stability in graphs (Q5090188) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
- (Q5883642) (← links)
- On the domination number of $t$-constrained de Bruijn graphs (Q6045459) (← links)
- On domination in signed graphs (Q6050454) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
- On the Zagreb indices of graphs with given Roman domination number (Q6097714) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Paired-domination game played on cycles (Q6103482) (← links)
- On global defensive k-alliances in zero-divisor graphs of finite commutative rings (Q6104115) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- Singleton coalition graph chains (Q6125425) (← links)
- (Q6159871) (← links)
- Complexity of total dominator coloring in graphs (Q6184152) (← links)
- Common domination perfect graphs (Q6184333) (← links)
- Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- Optimal linear‐Vizing relationships for (total) domination in graphs (Q6201029) (← links)
- The extended dominating sets in graphs (Q6542990) (← links)
