A Note on the Locating-Total Domination in Graphs
In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Tallennettuna:
| Päätekijät: | , , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
University of Zielona Góra
2017-08-01
|
| Sarja: | Discussiones Mathematicae Graph Theory |
| Aiheet: | |
| Linkit: | https://doi.org/10.7151/dmgt.1961 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|