Bounds on neighborhood total domination number in graphs
From MaRDI portal
Publication:2321595
DOI10.1007/s41980-018-0189-4zbMath1419.05084OpenAlexW2910132672WikidataQ128576098 ScholiaQ128576098MaRDI QIDQ2321595
Publication date: 23 August 2019
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-018-0189-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum number of edges in connected graphs with a given domination number
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Maximum sizes of graphs with given domination parameters
- Bounds on neighborhood total domination in graphs
- Neighbourhood total domination in graphs
- Total domination in graphs
- Total Domination in Graphs
This page was built for publication: Bounds on neighborhood total domination number in graphs