A new lower bound on the total domination number of a graph
From MaRDI portal
Publication:5880783
DOI10.2989/16073606.2021.1988002OpenAlexW4205604930MaRDI QIDQ5880783
Majid Hajian, Michael A. Henning, Nader Jafari Rad
Publication date: 6 March 2023
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2021.1988002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- A new upper bound on the total domination number of a graph
- Essential upper bounds on the total domination number
- A classification of cactus graphs according to their total domination number
- Total domination in graphs
- Total Domination in Graphs
- Lower bounds on the total domination number of a graph
This page was built for publication: A new lower bound on the total domination number of a graph