Open AccessA note on the locating-total domination in graphs
Author(s) -
R. Sundara Rajan,
R. Jayagopal,
Paul Manuel,
Mirka Miller,
Indra Rajasingh
Publication year - 2017
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1961
Subject(s) - mathematics , combinatorics , domination analysis , graph , vertex (graph theory)
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom