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.

Bibliographic Details
Main Authors: Miller Mirka, Rajan R. Sundara, Jayagopal R., Rajasingh Indra, Manuel Paul
Format: Article
Language:English
Published: University of Zielona Góra 2017-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1961
_version_ 1797718050707865600
author Miller Mirka
Rajan R. Sundara
Jayagopal R.
Rajasingh Indra
Manuel Paul
author_facet Miller Mirka
Rajan R. Sundara
Jayagopal R.
Rajasingh Indra
Manuel Paul
author_sort Miller Mirka
collection DOAJ
description 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.
first_indexed 2024-03-12T08:45:21Z
format Article
id doaj.art-e89aec8a8c9141fa9e27822be7372637
institution Directory Open Access Journal
issn 2083-5892
language English
last_indexed 2024-03-12T08:45:21Z
publishDate 2017-08-01
publisher University of Zielona Góra
record_format Article
series Discussiones Mathematicae Graph Theory
spelling doaj.art-e89aec8a8c9141fa9e27822be73726372023-09-02T16:29:57ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922017-08-0137374575410.7151/dmgt.1961dmgt.1961A Note on the Locating-Total Domination in GraphsMiller Mirka0Rajan R. Sundara1Jayagopal R.2Rajasingh Indra3Manuel Paul4School of Mathematical and Physical Sciences, University of Newcastle, Australia; Department of Mathematics, University of West Bohemia, Pilsen, Czech RepublicDepartment of Mathematics, Anna University, Chennai-600 025, IndiaSchool of Advanced Sciences, VIT University, Chennai-600 127, IndiaSchool of Advanced Sciences, VIT University, Chennai-600 127, IndiaDepartment of Information Science, Kuwait University, Safat, KuwaitIn 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.https://doi.org/10.7151/dmgt.1961dominating settotal dominating setlocating-dominating setlocating-total dominating setregular graphs05c69
spellingShingle Miller Mirka
Rajan R. Sundara
Jayagopal R.
Rajasingh Indra
Manuel Paul
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory
dominating set
total dominating set
locating-dominating set
locating-total dominating set
regular graphs
05c69
title A Note on the Locating-Total Domination in Graphs
title_full A Note on the Locating-Total Domination in Graphs
title_fullStr A Note on the Locating-Total Domination in Graphs
title_full_unstemmed A Note on the Locating-Total Domination in Graphs
title_short A Note on the Locating-Total Domination in Graphs
title_sort note on the locating total domination in graphs
topic dominating set
total dominating set
locating-dominating set
locating-total dominating set
regular graphs
05c69
url https://doi.org/10.7151/dmgt.1961
work_keys_str_mv AT millermirka anoteonthelocatingtotaldominationingraphs
AT rajanrsundara anoteonthelocatingtotaldominationingraphs
AT jayagopalr anoteonthelocatingtotaldominationingraphs
AT rajasinghindra anoteonthelocatingtotaldominationingraphs
AT manuelpaul anoteonthelocatingtotaldominationingraphs
AT millermirka noteonthelocatingtotaldominationingraphs
AT rajanrsundara noteonthelocatingtotaldominationingraphs
AT jayagopalr noteonthelocatingtotaldominationingraphs
AT rajasinghindra noteonthelocatingtotaldominationingraphs
AT manuelpaul noteonthelocatingtotaldominationingraphs