Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
A note on the locating-total domination in graphs
Miller M
,
Rajan R.S
,
Jayagopal R
,
Indra Rajasingh
,
Manuel P.
Published in Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora
2017
DOI:
10.7151/dmgt.1961
Volume: 37
Issue: 3
Pages: 745 - 754
Abstract
In this paper we obtain a sharp (improved) lower bound on the locatingtotal domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright,
Check License
PDF
Citations (1)
Journal Details
Authors (2)
About the journal
Journal
Discussiones Mathematicae Graph Theory
Publisher
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora
ISSN
1234-3099
Open Access
0
Authors (2)
Jayagopal R
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Domination Parameters in Hypertrees
Combinatorial Properties of Root-fault Hypertrees
A note on the locating-total domination in graphs
Locating-total domination in graphs
Indra Rajasingh
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Investigating substructures in goal oriented online communities: Case study of Ubuntu IRC
Induced Matching Partition of Petersen and Circulant Graphs
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Metric dimension of directed graphs
Get all the updates for this publication
Follow