Topics in Domination in Graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1124608
- scientific article; zbMATH DE number 1095172
- On Domination in Graphs
- scientific article; zbMATH DE number 1095171
- Theory of domination in graphs
- Domination in Graphs: Core Concepts
- scientific article; zbMATH DE number 6863591
- Domination in graphs
- scientific article; zbMATH DE number 1342030
- Domination in Graphs
Cited in
(only showing first 100 items - show all)- On global defensive k-alliances in zero-divisor graphs of finite commutative rings
- Universal cycles that generate all graphs of coalition partitions in cycles
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Domination in Graphs: Core Concepts
- On the Zagreb indices of graphs with given Roman domination number
- More on the complexity of defensive domination in graphs
- Disjunctive total domination in maximal outerplanar graphs
- On the domination number of $t$-constrained de Bruijn graphs
- Local metric dimension for graphs with small clique numbers
- Paired versus double domination in forbidden graph classes
- Domination versus total domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Total domination in graphs
- 2-domination critical trees upon edge subdivision
- Maximal outerplanar graphs with semipaired domination number double the domination number
- Paired-domination game played on cycles
- More results on the signed double Roman k-domination in graphs
- On the connected coalition number of graphs
- Minimal Roman dominating functions: extensions and enumeration
- Fault-tolerant total domination via submodular function approximation
- GLOBAL METRO DOMINATION OF GRAPHS
- The extended dominating sets in graphs
- Triangles and (total) domination in subcubic graphs
- k-domination invariants on Kneser graphs
- Paired-domination in binary trees
- Multiple domination
- Computational aspects of double dominating sequences in graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
- Singleton coalition graph chains
- Some complexity results on semipaired domination in graphs
- A note on double domination in graphs
- Heuristics for the weighted total domination problem
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Minimal graphs with disjoint dominating and total dominating sets
- Semi-total domination in unit disk graphs
- Roman domination in direct product graphs and rooted product graphs
- Connected coalitions in graphs
- Partitioning zero-divisor graphs of finite commutative rings into global defensive alliances
- The 2-rainbow domination number of Cartesian product of cycles
- Dominant sets with neighborhood for trees
- Complexity results on cosecure domination in graphs
- On irredundance coloring and irredundance compelling coloring of graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Conjectures of TxGraffiti: independence, domination, and matchings
- Paired coalition in graphs
- Indicated total domination game
- A graph theoretical approach to optimizing minimum Italian domination sets
- Roman domination in oriented trees
- On 2-domination and 2-rainbow domination of cylindrical graphs
- Double coalitions in regular graphs
- Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Complexity of total dominator coloring in graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- Bipartite domination in graphs: complexity and algorithms
- The minmin coalition number in graphs
- Nordhaus-Gaddum bounds for upper total domination
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- 3-neighbor bootstrap percolation on grids
- Characterization of -excellent 2-trees
- End super dominating sets in graphs
- Double dominating sequences in bipartite and co-bipartite graphs
- Algorithmic aspects of paired disjunctive domination in graphs
- Roman cycle hitting set
- Distance dominator packing coloring of type II
- Some general results on paired disjunctive domination and calculations in certain Mycielski graphs
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set
- On hop domination number of some generalized graph structures
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Minimal Roman dominating functions: extensions and enumeration
- Paired domination stability in graphs
- Double coalitions in graphs
- On the domination number of graphs with minimum degree at least seven
- New bounds on the double domination number of trees
- Computation of Grundy dominating sequences in (co-)bipartite graphs
- Structures of domination in graphs
- Complexity of paired domination in at-free and planar graphs
- Parameterized complexity of paired domination
- Perfect Roman domination: aspects of enumeration and parameterization
- On 3-component domination numbers in graphs
- Complexity of 2-rainbow total domination problem
- Introduction to ``Topics on Domination
- On domination in signed graphs
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- Approximation algorithm and hardness results for defensive domination in graphs
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- Algorithmic study on 2-transitivity of graphs
- A characterization of graphs with given total coalition numbers
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Bounds on the outer-independent double Italian domination number
- Certain variants of domatic partitions of n-inordinate invariant intersection graphs
- Cosecure domination: hardness results and algorithms
- Common domination perfect graphs
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- A lower bound for the second Zagreb index of trees with given Roman domination number
- Paired-domination game played on paths
- The Sierpiński domination number
- A study of extremal trees for the ABS index based on total domination number and its predictive power in molecular modeling
- Closed neighborhood ideals of finite simple graphs
This page was built for publication: Topics in Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146715)
