Structures of domination in graphs
From MaRDI portal
Publication:5137150
Recommendations
Cited in
(93)- Structural parameterizations of dominating set variants
- 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
- Approximation algorithm and hardness results for defensive domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- Domination in certain chemical graphs
- Total domination in graphs
- Bounds on signed total double Roman domination
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Nordhaus-Gaddum bounds for upper total domination
- Domination and leaf density in graphs
- Conjectures of TxGraffiti: independence, domination, and matchings
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- 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
- Paired-domination game played on cycles
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
- Singleton coalition graph chains
- Computing vertex resolvability of some regular planar graphs
- Computational aspects of double dominating sequences in graphs
- Complexity results on cosecure domination in graphs
- 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
- Optimal linear‐Vizing relationships for (total) domination in graphs
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- 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
- 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
- Cycle-compelling colorings of graphs
- The Sierpiński domination number
- 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
- Enumerating minimal defensive alliances
- On k-rainbow total domination and a related conjecture
- Strong domination number of graphs from primary subgraphs
- Total coalitions in claw-free cubic graphs containing double-bonded triangle-units
- On the parameterized complexity of cosecure domination
- Estimation of domination number of graphs via safe number
- 2-domination edge subdivision in trees
- Total domination and open packing in some subclasses of bipartite graphs
- New bounds on Zagreb connection indices for trees with fixed domination number
- Universal cycles that generate all graphs of coalition partitions in cycles
- In-domatic number and some operations in digraphs
- 2-domination critical trees upon edge subdivision
- More results on the signed double Roman k-domination in graphs
- k-domination invariants on Kneser graphs
- Paired-domination in binary trees
- Some complexity results on semipaired domination in graphs
- 3-neighbor bootstrap percolation on grids
- Characterization of -excellent 2-trees
- End super dominating sets in graphs
- Defensive alliances in signed networks
- Double dominating sequences in bipartite and co-bipartite graphs
- Minimal graphs with disjoint dominating and total dominating sets
- Some general results on paired disjunctive domination and calculations in certain Mycielski graphs
- On irredundance coloring and irredundance compelling coloring of graphs
- Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set
- Indicated total domination game
- Double coalitions in graphs
- On the domination number of graphs with minimum degree at least seven
- Parameterized complexity of paired domination
- Perfect Roman domination: aspects of enumeration and parameterization
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Dual-server domination in graphs
- New upper bounds on Zagreb indices with given domination number
- Disjunctive total domination in maximal outerplanar graphs
- Improving a bound that relates the size of a bipartite graph with its restrained domination number
- On 3-component domination in trees
- A note on the complexity of defensive domination
- Majority sets in graphs
- Italian domination number of graphs generated by various corona product
- Signed Roman domination in trees
This page was built for publication: Structures of domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137150)
