Total domination in graphs with given girth

DOI10.1007/S00373-008-0797-5MaRDI QIDQ1014823zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, A. Yeo

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

hypergraphstotal domination numbertransversalsvertex dominationtotal dominating set of vertices

Mathematics Subject Classification ID

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

Recommendations

• Girth and total domination in graphs
• scientific article; zbMATH DE number 1109413
• Total domination in graphs
• Total domination of graphs
• On the total domination number of graphs
• Domination number of total graphs
• Domination in graphs of minimum degree at least two and large girth
• On the domination number of a graph and its total graph
• Total domination in regular graphs
• On total dominating sets in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Covering all cliques of a graph
• Domination in graphs of minimum degree at least two and large girth
• Graphs with large total domination number
• Small transversals in hypergraphs
• Some remarks on domination
• Total domination in graphs
• Total domination of graphs and small transversals of hypergraphs
• Upper bounds on the total domination number

Cited in

(13)

• Existence of graphs with a given domination parameter
• Total domination in planar graphs of diameter two
• Relating ordinary and total domination in cubic graphs of large girth
• Asymptotic bounds on total domination in regular graphs
• A survey of selected recent results on total domination in graphs
• Dominating sets inducing large components
• Domination and total domination in cubic graphs of large girth
• Girth and total domination in graphs
• An improved upper bound on the total restrained domination number in cubic graphs
• Total domination in regular graphs
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Dominating and total dominating partitions in cubic graphs
• Multiple domination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014823)