Total domination in graphs with given girth

DOI10.1007/s00373-008-0797-5zbMath1180.05080OpenAlexW2099244389MaRDI QIDQ1014823

Anders Yeo, Michael A. Henning

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0797-5

zbMATH Keywords

transversalshypergraphstotal domination numbervertex dominationtotal dominating set of vertices

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Total domination in regular graphs ⋮ Dominating sets inducing large components ⋮ Asymptotic bounds on total domination in regular graphs ⋮ An improved upper bound on the total restrained domination number in cubic graphs ⋮ Girth and total domination in graphs ⋮ Domination and total domination in cubic graphs of large girth ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Relating ordinary and total domination in cubic graphs of large girth ⋮ A survey of selected recent results on total domination in graphs ⋮ Multiple Domination ⋮ Total domination in planar graphs of diameter two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination of graphs and small transversals of hypergraphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Domination in graphs of minimum degree at least two and large girth
• Total domination in graphs
• Some remarks on domination
• Graphs with large total domination number

This page was built for publication: Total domination in graphs with given girth