Complexity and bounds for disjunctive total bondage
Author:
- Canan ÇiftçiCÇCanan Çiftçi
- 1 April 2021
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 865, 44-51
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bounds on the disjunctive total domination number of a treeDiscussiones Mathematicae Graph Theory, 2016
- Disjunctive total domination in graphsJournal of Combinatorial Optimization, 2014
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphsTheoretical Computer Science, 2014
- ON THE ROMAN BONDAGE NUMBER OF A GRAPHDiscrete Mathematics, Algorithms and Applications, 2013
- Total restrained bondage in graphsActa Mathematica Sinica, English Series, 2013
- Restrained bondage in graphsDiscrete Mathematics, 2008
- Paired bondage in treesDiscrete Mathematics, 2008
- The bondage number of a graphDiscrete Mathematics, 1990
- Domination alteration sets in graphsDiscrete Mathematics, 1983
- Total domination in graphsNetworks, 1980