On upper total domination versus upper domination in graphs
From MaRDI portal
Publication:2000568
DOI10.1007/S00373-019-02029-YzbMATH Open1416.05217OpenAlexW2919073589MaRDI QIDQ2000568FDOQ2000568
Enqiang Zhu, Fei Deng, Yongsheng Rao, Chanjuan Liu
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Total dominating sequences in graphs
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Total domination versus domination in cubic graphs
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- Total domination in graphs with diameter 2
- On the upper total domination number of Cartesian products of graphs
Cited In (8)
- Upper total domination versus upper paired-domination
- Upper eccentric domination in graphs
- Title not available (Why is that?)
- On upper domination Ramsey numbers for graphs.
- Mixed domination and 2-independence in trees
- Title not available (Why is that?)
- Upper majority domination number of a graph
- Title not available (Why is that?)
Uses Software
This page was built for publication: On upper total domination versus upper domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000568)