On upper total domination versus upper domination in graphs
From MaRDI portal
Publication:2000568
DOI10.1007/s00373-019-02029-yzbMath1416.05217OpenAlexW2919073589MaRDI QIDQ2000568
Fei Deng, Yongsheng Rao, Chanjuan Liu, En-Qiang Zhu
Publication date: 28 June 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02029-y
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Total dominating sequences in graphs
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- On the upper total domination number of Cartesian products of graphs
- A survey of selected recent results on total domination in graphs
- Total domination versus domination in cubic graphs
- Total Domination in Graphs with Diameter 2
- Total domination in graphs
- Graph Classes: A Survey
This page was built for publication: On upper total domination versus upper domination in graphs