Topics in Domination in Graphs
From MaRDI portal
Publication:5146715
DOI10.1007/978-3-030-51117-3zbMath1470.05008OpenAlexW4214483257MaRDI QIDQ5146715
No author found.
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
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (56)
Improved bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ A note on the k-tuple domination number of graphs ⋮ 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 ⋮ Unnamed Item ⋮ Closed neighborhood ideals of finite simple graphs ⋮ ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ GLOBAL METRO DOMINATION OF GRAPHS ⋮ Complexity of paired domination in AT-free and planar graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Paired domination stability in graphs ⋮ Construction for trees without domination critical vertices ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Zagreb indices of graphs with given Roman domination number ⋮ A note on double domination in graphs ⋮ Roman domination in oriented trees ⋮ On (1,2)-domination in cubic graphs ⋮ Multiple Domination ⋮ 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
This page was built for publication: Topics in Domination in Graphs
