A note on the complexity of locating-total domination in graphs

From MaRDI portal
Publication:2333807

DOI10.1016/J.TCS.2019.09.039zbMath1436.68257OpenAlexW2978963472WikidataQ127195776 ScholiaQ127195776MaRDI QIDQ2333807

Yanyan Li

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.039




Related Items (2)




Cites Work




This page was built for publication: A note on the complexity of locating-total domination in graphs