Pages that link to "Item:Q2420416"
From MaRDI portal
The following pages link to On the super domination number of lexicographic product graphs (Q2420416):
Displaying 17 items.
- Double domination in lexicographic product graphs (Q777395) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- Domination related parameters in the generalized lexicographic product of graphs (Q2030248) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- Super domination in trees (Q2071243) (← links)
- Weak Roman domination in rooted product graphs (Q2144851) (← links)
- Italian domination in rooted product graphs (Q2227964) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- CONNECTED SUPER DOMINATION IN GRAPHS (Q4973402) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- Super domination in trees (Q5083859) (← links)
- Relating the super domination and 2-domination numbers in cactus graphs (Q6049719) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
- Super domination: graph classes, products and enumeration (Q6130203) (← links)
