Topics in Domination in Graphs
From MaRDI portal
Publication:5146715
DOI10.1007/978-3-030-51117-3zbMATH Open1470.05008OpenAlexW4214483257MaRDI QIDQ5146715FDOQ5146715
Authors:
Publication date: 26 January 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3
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
Collections of articles of miscellaneous specific interest (00B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)
Cited In (80)
- Conjectures of TxGraffiti: independence, domination, and matchings
- Roman domination in oriented trees
- Complexity of total dominator coloring in graphs
- 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
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Algorithmic aspects of paired disjunctive domination in graphs
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- On hop domination number of some generalized graph structures
- Minimal Roman dominating functions: extensions and enumeration
- Paired domination stability in graphs
- Computation of Grundy dominating sequences in (co-)bipartite graphs
- New bounds on the double domination number of trees
- Complexity of paired domination in at-free and planar graphs
- Structures of domination in graphs
- On domination in signed graphs
- Bounds on the outer-independent double Italian domination number
- Introduction to ``Topics on Domination
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- Approximation algorithm and hardness results for defensive domination in 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
- Title not available (Why is that?)
- Closed neighborhood ideals of finite simple graphs
- On (1,2)-domination in cubic graphs
- New bounds on the double total domination number of graphs
- Perfect Italian domination in graphs: complexity and algorithms
- On the total and strong version for Roman dominating functions in graphs
- A note on the k-tuple domination number of graphs
- Computational complexity aspects of super domination
- Partial domination in supercubic graphs
- Bounds on domination parameters in graphs: a brief survey
- Complexity of paired domination in AT-free and planar graphs
- Construction for trees without domination critical vertices
- Further results on the independent Roman domination number of graphs
- On global defensive k-alliances in zero-divisor graphs of finite commutative rings
- 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
- On the domination number of $t$-constrained de Bruijn graphs
- Local metric dimension for graphs with small clique numbers
- Total domination in graphs
- Domination versus total domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Paired-domination game played on cycles
- Fault-tolerant total domination via submodular function approximation
- GLOBAL METRO DOMINATION OF GRAPHS
- Triangles and (total) domination in subcubic graphs
- Computational aspects of double dominating sequences in graphs
- Multiple domination
- A note on double domination in graphs
- Roman domination in direct product graphs and rooted product 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
- Cosecure domination: hardness results and algorithms
- Common domination perfect graphs
- Paired-domination game played on paths
- The Sierpiński domination number
- Some new algorithmic results on co-secure domination in graphs
- On the complexity of co-secure dominating set problem
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- Optimal linear‐Vizing relationships for (total) domination in graphs
- 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
- Minimal Roman dominating functions: extensions and enumeration
- The extended dominating sets in graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
- Singleton coalition graph chains
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Semi-total domination in unit disk graphs
- Complexity results on cosecure domination in 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)
