The following pages link to (Q4863436):
Displaying 29 items.
- On unique minimum dominating sets in some Cartesian product graphs (Q891308) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Defending the Roman Empire---a new strategy (Q1810648) (← links)
- Maximum graphs with a unique minimum dominating set (Q1861257) (← links)
- Uniqueness of strongly regular graphs having minimal \(p\)-rank (Q1899393) (← links)
- Unique minimum semipaired dominating sets in trees (Q2107740) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Graphs with a unique maximum independent set up to automorphisms (Q2142697) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
- On accurate domination in graphs (Q2416947) (← links)
- Changing and unchanging of the domination number of a graph (Q2519817) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- On the number of minimum dominating sets in trees (Q2699794) (← links)
- Graphs with unique dominating sets (Q2816086) (← links)
- (Q3565859) (← links)
- Trees with unique minimum total dominating sets (Q4435560) (← links)
- (Q4443258) (← links)
- (Q4529516) (← links)
- Domination cover number of graphs (Q4634292) (← links)
- Edge lifting and Roman domination in graphs (Q5025139) (← links)
- More on the unimodality of domination polynomial of a graph (Q5083860) (← links)
- Graphs with equal domination and certified domination numbers (Q5106692) (← links)
- (Q5463537) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
- Graphs with unique minimum specified domination sets (Q6063278) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
