The following pages link to P. Roushini Leely Pushpam (Q327645):
Displayed 34 items.
- (Q215008) (redirect page) (← links)
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- The independent transversal dombondage number of a graph (Q327649) (← links)
- Weak Roman bondage number of a graph (Q779190) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- On total Roman domination in graphs (Q1683575) (← links)
- Restrained differential of a graph (Q1683577) (← links)
- Effect of vertex deletion on the weak Roman domination number of a graph (Q2293840) (← links)
- Secure restrained domination in graphs (Q2516512) (← links)
- (Q2786392) (← links)
- m-Eternal total domination in graphs (Q2821121) (← links)
- A-differentials and total domination in graphs (Q2831142) (← links)
- Roman domination in unicyclic graphs (Q2833278) (← links)
- (Q2839653) (← links)
- (Q3099538) (← links)
- Weak Roman domination in graphs (Q3171420) (← links)
- (Q3417449) (← links)
- (Q3452025) (← links)
- (Q3565899) (← links)
- (Q4469604) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
- On super (a,d)-edge antimagic total labeling of certain families of graphs (Q4648785) (← links)
- Graphs with unique minimum acyclic graphoidal cover – I (Q4670756) (← links)
- Resolving Roman domination in graphs (Q5057732) (← links)
- Weak Roman subdivision number of graphs (Q5063279) (← links)
- Further results on secure restrained domination in graphs (Q5069776) (← links)
- (Q5070078) (← links)
- (Q5134012) (← links)
- Secure vertex cover of a graph (Q5347260) (← links)
- (Q5463499) (← links)
- An algorithm to recognize weak roman domination stable trees under vertex deletion (Q5858156) (← links)
- The stability of independent transversal domination in trees (Q5859512) (← links)
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree (Q5948980) (← links)
- (Q6149321) (← links)