Pages that link to "Item:Q1786876"

The following pages link to Secure total domination in graphs: bounds and complexity (Q1786876):

Displaying 21 items.

• On the secure domination numbers of maximal outerplanar graphs (Q1693127) (← links)
• The complexity of secure domination problem in graphs (Q1708386) (← links)
• Secure Italian domination in graphs (Q2025095) (← links)
• Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
• Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
• Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
• Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
• Total protection of lexicographic product graphs (Q2151225) (← links)
• From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
• On secure domination in graphs (Q2348710) (← links)
• Graphs with diameter 2 and large total domination number (Q2657085) (← links)
• Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
• On the complexity of strong and weak total domination in graphs (Q2820195) (← links)
• Eternal and Secure Domination in Graphs (Q3384616) (← links)
• Secure domination and secure total domination in graphs (Q3606454) (← links)
• Secure total domination in chain graphs and cographs (Q4956172) (← links)
• On computing secure domination of trees (Q5025125) (← links)
• Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
• Secure domination of some graph operators (Q6089327) (← links)
• Secure total domination number in maximal outerplanar graphs (Q6546418) (← links)
• An algorithm for the secure total domination problem in proper interval graphs (Q6590080) (← links)