Pages that link to "Item:Q2839667"
From MaRDI portal
The following pages link to Changing and unchanging the roman domination number of graph (Q2839667):
Displaying 17 items.
- Some results on roman domination edge critical graphs (Q1927700) (← links)
- Characterization of trees with Roman bondage number 1 (Q2132180) (← links)
- Effect of vertex deletion on the weak Roman domination number of a graph (Q2293840) (← links)
- Extremal digraphs for an upper bound on the Roman domination number (Q2331577) (← links)
- On the Roman domination stable graphs (Q2409777) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- On the 2-rainbow domination stable graphs (Q2424728) (← links)
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\) (Q2821115) (← links)
- Vertex and edge critical Roman domination in graphs (Q2870947) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- (Q4616111) (← links)
- Critical graphs with Roman domination number four (Q4956166) (← links)
- Critical concept for double Roman domination in graphs (Q5854749) (← links)
- (Q6150894) (← links)
- A counterexample to a conjecture of Jafari Rad and Volkmann (Q6158955) (← links)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
- Italian, 2-rainbow and Roman domination numbers in middle graphs (Q6550940) (← links)
