Complexity and bounds for disjunctive total bondage

DOI10.1016/j.tcs.2021.02.032zbMath1502.05183OpenAlexW3132456866MaRDI QIDQ2661777

C. Çiftçi

Publication date: 8 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.032

zbMATH Keywords

complexityNP-completenessdisjunctive total dominationdisjunctive total bondage

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• On the bondage number of middle graphs
• Domination alteration sets in graphs
• Bounds on the disjunctive total domination number of a tree
• Restrained bondage in graphs
• Paired bondage in trees
• The bondage number of a graph
• A bound on the size of a graph with given order and bondage number
• Total restrained bondage in graphs
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• Total bondage number of a graph
• The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs
• Total domination in graphs
• ON THE ROMAN BONDAGE NUMBER OF A GRAPH
• Disjunctive Total Domination Subdivision Number of Graphs
• Graphs with Large Disjunctive Total Domination Number
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems

This page was built for publication: Complexity and bounds for disjunctive total bondage