Secure total domination in graphs: Bounds and complexity
Author:
- 1 May 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 222, 97-108
Abstract
No abstract availableKeywords
Funding Information
- Belarusian Republican Foundation for Fundamental Research (F14RA-004)
This publication has 11 references indexed in Scilit:
- Secure domination and secure total domination in the composition G[Kn]International Journal of Mathematical Analysis, 2014
- Graphs of separability at most 2Discrete Applied Mathematics, 2012
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphsJournal of Combinatorial Optimization, 2010
- A survey of selected recent results on total domination in graphsDiscrete Mathematics, 2009
- Approximation hardness of dominating set problems in bounded degree graphsInformation and Computation, 2008
- Secure domination and secure total domination in graphsDiscussiones Mathematicae Graph Theory, 2008
- Face Covers and the Genus Problem for Apex GraphsJournal of Combinatorial Theory, Series B, 2001
- Eigensharp graphs: decomposition into complete bipartite subgraphsTransactions of the American Mathematical Society, 1988
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Dominating sets for split and bipartite graphsInformation Processing Letters, 1984