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)- A note on double domination in graphs
- On (1,2)-domination in cubic graphs
- New bounds on the double total domination number of graphs
- Local metric dimension for graphs with small clique numbers
- Domination versus total domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Triangles and (total) domination in subcubic graphs
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- New bounds on the double domination number of trees
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- Approximation algorithm and hardness results for defensive domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- Closed neighborhood ideals of finite simple graphs
- Perfect Italian domination in graphs: complexity and algorithms
- Complexity of paired domination in AT-free and planar graphs
- On the total and strong version for Roman dominating functions in graphs
- Construction for trees without domination critical vertices
- Roman domination in direct product graphs and rooted product graphs
- Multiple domination
- Total domination in graphs
- Bounds on the outer-independent double Italian domination number
- Roman domination in oriented trees
- A note on the k-tuple domination number of graphs
- On hop domination number of some generalized graph structures
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- GLOBAL METRO DOMINATION OF GRAPHS
- Nordhaus-Gaddum bounds for upper total domination
- Paired domination stability in graphs
- Domination in Graphs: Core Concepts
- Structures of domination in graphs
- Conjectures of TxGraffiti: independence, domination, and matchings
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- Further results on the independent Roman domination number of graphs
- Minimal Roman dominating functions: extensions and enumeration
- On the domination number of $t$-constrained de Bruijn graphs
- On domination in signed graphs
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- Computational complexity aspects of super domination
- Partial domination in supercubic graphs
- On the Zagreb indices of graphs with given Roman domination number
- Algorithmic aspects of paired disjunctive domination in graphs
- Complexity of paired domination in at-free and planar graphs
- Paired-domination game played on cycles
- On global defensive k-alliances in zero-divisor graphs of finite commutative rings
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Fault-tolerant total domination via submodular function approximation
- Roman domination and independent Roman domination on graphs with maximum degree three
- Singleton coalition graph chains
- Computational aspects of double dominating sequences in graphs
- Complexity results on cosecure domination in graphs
- A lower bound for the second Zagreb index of trees with given Roman domination number
- Cosecure domination: hardness results and algorithms
- Complexity of total dominator coloring in graphs
- Common domination perfect graphs
- Computation of Grundy dominating sequences in (co-)bipartite graphs
- Some new algorithmic results on co-secure domination in graphs
- On the complexity of co-secure dominating set problem
- Optimal linear‐Vizing relationships for (total) domination in graphs
- The extended dominating sets in graphs
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Minimal Roman dominating functions: extensions and enumeration
- Semi-total domination in unit disk graphs
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
- Best possible upper bounds on the restrained domination number of cubic graphs
- Complexity of 2-rainbow total domination problem
- 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
- Paired-domination game played on paths
- The Sierpiński domination number
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- Divisor 2-equitable domination in fuzzy graphs
- Transversal coalitions in hypergraphs
- Total coalitions in graphs
- More on the complexity of defensive domination in graphs
- Paired versus double domination in forbidden graph classes
- A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
- Disjunctive domination in maximal outerplanar graphs
- On k-rainbow total domination and a related conjecture
- Total coalitions in claw-free cubic graphs containing double-bonded triangle-units
- A study on Roman domination in deg-centric graphs
- Rainbow dominator coloring of some cycle related graphs
- On the parameterized complexity of cosecure domination
- Double domination number of inflated graphs
- Changing and unchanging of the connected domination number of a graph
- Estimation of domination number of graphs via safe number
- 2-domination edge subdivision in trees
- A lower bound for the first hyper-Zagreb index of trees with given Roman domination number
- New bounds on Zagreb connection indices for trees with fixed domination number
- t-closed neighborhood ideal of a graph
- Universal cycles that generate all graphs of coalition partitions in cycles
- 2-domination critical trees upon edge subdivision
- Maximal outerplanar graphs with semipaired domination number double the domination number
- More results on the signed double Roman k-domination in graphs
- On the connected coalition number of graphs
- k-domination invariants on Kneser graphs
- Paired-domination in binary trees
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)
