Weak Roman domination in graphs
From MaRDI portal
Publication:3171420
DOI10.7151/DMGT.1532zbMATH Open1284.05201OpenAlexW1989438579MaRDI QIDQ3171420FDOQ3171420
Authors: T. N. M. Malini Mai, P. Roushini Leely Pushpam 
Publication date: 5 October 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ea631453e701e79acf1bc8e0439c215c356690bf
Recommendations
- scientific article; zbMATH DE number 6129508
- Weakly connected Roman domination in graphs
- Weak edge Roman domination in graphs
- scientific article; zbMATH DE number 7509363
- Some results of weak Roman domination number in graphs
- Weak signed Roman domination in graphs
- Roman domination in graphs
- Weak Roman domination in rooted product graphs
- Weak signed Roman \(k\)-domination in graphs
- Roman domination in regular graphs
Cited In (29)
- Title not available (Why is that?)
- Roman \(\{2 \}\)-domination
- On the weak Roman domination number of lexicographic product graphs
- Trees \(T\) with weak Roman domination number being equal to domination number
- Bounds on weak Roman and 2-rainbow domination numbers
- Graphs whose weak Roman domination number increases by the deletion of any edge
- Title not available (Why is that?)
- Improved integer linear programming formulation for weak Roman domination problem
- Six safe grades on weak Roman domination
- Weak Roman domination stable graphs upon edge-addition
- Effect of vertex deletion on the weak Roman domination number of a graph
- Title not available (Why is that?)
- Algorithmic complexity of weakly connected Roman domination in graphs
- Exact Algorithms for Weak Roman Domination
- Some results of weak Roman domination number in graphs
- Roman \(\{2\}\)-bondage number of a graph
- Weak double Roman domination
- An algorithm to recognize weak Roman domination stable trees under vertex deletion
- Roman domination in unicyclic graphs
- Weak Roman bondage number of a graph
- Varieties of Roman Domination
- Secure vertex cover of a graph
- Weak Roman subdivision number of graphs
- Restrained Roman domination in graphs
- Double Roman domination number
- Weakly connected Roman domination in graphs
- Exact algorithms for weak Roman domination
- Weak edge Roman domination in graphs
- Weak signed Roman domination in graphs
This page was built for publication: Weak Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171420)
