The following pages link to (Q5461685):
Displaying 50 items.
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- Upper secure domination number of a graph (Q327666) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- A characterization of trees with equal independent domination and secure domination numbers (Q503603) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- The roman domatic number of a graph (Q990809) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← 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)
- Edge criticality in secure graph domination (Q1751134) (← 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)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- Weak Roman domination in rooted product graphs (Q2144851) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← 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)
- Co-Roman domination in graphs (Q2344075) (← links)
- On secure domination in graphs (Q2348710) (← links)
- Complexity issues of variants of secure domination in graphs (Q2413340) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Secure domination in cographs (Q2416434) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Signed Roman domination in graphs (Q2444148) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Roman dominating influence parameters (Q2463905) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- Security in Sierpiński graphs (Q2685692) (← links)
- A note on secure domination in \(C_5\)-free graphs (Q2700614) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- m-Eternal total domination in graphs (Q2821121) (← links)
- (Q2848728) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
