Pages that link to "Item:Q266033"

The following pages link to Disjunctive total domination in graphs (Q266033):

Displaying 13 items.

• Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
• Bounds on the disjunctive total domination number of a tree (Q907839) (← links)
• Porous exponential domination in Harary graphs (Q2191954) (← links)
• Complexity and bounds for disjunctive total bondage (Q2661777) (← links)
• b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
• Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
• Disjunctive total domination in permutation graphs (Q2966509) (← links)
• Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
• The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs (Q3467878) (← links)
• On disjunctive domination in graphs (Q5221839) (← links)
• A constructive characterization of trees with equal total domination and disjunctive domination numbers (Q5233942) (← links)
• Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
• Analysis of Vulnerability of Some Transformation Networks (Q6169956) (← links)