The following pages link to (Q4812925):
Displaying 38 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)
- Global secure sets of grid-like graphs (Q628346) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- On the global Roman domination number in graphs (Q1708687) (← 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)
- Weak Roman domination in rooted product graphs (Q2144851) (← 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)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- On secure domination in graphs (Q2348710) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Tight bounds for eternal dominating sets in graphs (Q2427517) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Roman dominating influence parameters (Q2463905) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- A note on secure domination in \(C_5\)-free graphs (Q2700614) (← links)
- \(m\)-eternal total domination in graphs (Q2821121) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS (Q4973429) (← links)
- Further results on secure restrained domination in graphs (Q5069776) (← 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)
- Secure vertex cover of a graph (Q5347260) (← links)
- Secure equitability in graphs (Q6174164) (← links)
- The secure metric dimension of the globe graph and the flag graph (Q6633252) (← links)
