The following pages link to On secure domination in graphs (Q2348710):
Displaying 43 items.
- Global security in claw-free cubic graphs (Q401130) (← links)
- Integer and fractional security in graphs (Q442229) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- On the secure domination numbers of maximal outerplanar graphs (Q1693127) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- Secure domination of honeycomb networks (Q2185819) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Security in graphs (Q2381534) (← links)
- Complexity issues of variants of secure domination in graphs (Q2413340) (← links)
- Secure domination in cographs (Q2416434) (← links)
- A note on secure domination in \(C_5\)-free graphs (Q2700614) (← links)
- Co-secure and secure domination in graphs (Q2878212) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Secure domination and secure total domination in graphs (Q3606454) (← links)
- Secure domination subdivision number of a graph (Q4968284) (← links)
- Algorithmic Aspects of Some Variants of Domination in Graphs (Q5002958) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Protection of graphs with emphasis on Cartesian product graphs (Q5080300) (← links)
- On secure domination in trees (Q5236045) (← links)
- Protection of a network by complete secure domination (Q5884131) (← links)
- (Q6145882) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- Secure total domination number in maximal outerplanar graphs (Q6546418) (← links)
- A lower bound for secure domination number of an outerplanar graph (Q6611009) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
