A note on -total domination in cubic graphs
From MaRDI portal
Publication:516909
DOI10.1016/J.DAM.2016.09.049zbMATH Open1358.05211OpenAlexW2549579649MaRDI QIDQ516909FDOQ516909
Authors: Xuegang Chen, Ting Gao
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.049
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- \(\alpha\)-domination
- Some remarks on alpha-domination
- Upper bounds for \(\alpha \)-domination parameters
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- On \(\alpha\)-total domination in graphs
- Randomized algorithms and upper bounds for multiple domination in graphs and networks
Cited In (6)
This page was built for publication: A note on \(\alpha\)-total domination in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516909)