Structures of Domination in Graphs

DOI10.1007/978-3-030-58892-2zbMath1470.05007OpenAlexW4248338579MaRDI QIDQ5137150

No author found.

Publication date: 1 December 2020

Published in: Developments in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2

Mathematics Subject Classification ID

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 (31)

Bounds on signed total double Roman domination ⋮ 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 ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ 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 ⋮ Unnamed Item ⋮ 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

This page was built for publication: Structures of Domination in Graphs