Pages that link to "Item:Q3519295"
From MaRDI portal
The following pages link to Vertex Covers and Secure Domination in Graphs (Q3519295):
Displayed 22 items.
- Upper secure domination number of a graph (Q327666) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← 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)
- Edge criticality in secure graph domination (Q1751134) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- Secure domination in cographs (Q2416434) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
- Protection of graphs with emphasis on Cartesian product graphs (Q5080300) (← links)
- On minimum secure dominating sets of graphs (Q5233913) (← links)
- On secure domination in trees (Q5236045) (← links)
- (Q6145882) (← links)
- Secure equitability in graphs (Q6174164) (← links)