Pages that link to "Item:Q1730021"
From MaRDI portal
The following pages link to The secure domination problem in cographs (Q1730021):
Displaying 22 items.
- Upper secure domination number of a graph (Q327666) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- On secure domination in graphs (Q2348710) (← links)
- Secure domination in cographs (Q2416434) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- A note on secure domination in \(C_5\)-free graphs (Q2700614) (← links)
- Co-secure and secure domination in graphs (Q2878212) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- Secure domination subdivision number of a graph (Q4968284) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Secure domination of some graph operators (Q6089327) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← 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)
