A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph

DOI10.1016/J.DAM.2024.07.009zbMATH Open1547.05224MaRDI QIDQ6611042

Ernst J. Joubert

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper bounddominationtotal restrained domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Total restrained domination in claw-free graphs with minimum degree at least two
• Bounds on the total restrained domination number of a graph
• Total restrained domination in graphs with minimum degree two
• On a conjecture involving a bound for the total restrained domination number of a graph
• Restrained domination in trees
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Remarks on restrained domination and total restrained domination in graphs
• Restrained and Total Restrained Domination in Graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Total Domination in Graphs
• Domination in Graphs: Core Concepts
• Structures of Domination in Graphs
• Topics in Domination in Graphs

This page was built for publication: A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph

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