An improved upper bound on the total restrained domination number in cubic graphs

DOI10.1007/s00373-011-1059-5zbMath1256.05177MaRDI QIDQ1926030

Michael A. Henning, Justin Southey

Publication date: 27 December 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-011-1059-5

zbMATH Keywords

bounds; cubic graphs; total restrained domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

2-colorings in \(k\)-regular \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total restrained domination in trees
• Total domination of graphs and small transversals of hypergraphs
• Total restrained domination in graphs with minimum degree two
• A survey of selected recent results on total domination in graphs
• Total domination in graphs with given girth
• Total restrained domination in cubic graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Total restrained domination numbers of trees
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On total restrained domination in graphs
• Remarks on restrained domination and total restrained domination in graphs
• Trees with equal total and total restrained domination numbers
• Hypergraphs with large transversal number and with edge sizes at least 3
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Some remarks on domination