Edge roman domination in graphs
From MaRDI portal
Publication:3565899
zbMATH Open1195.05056MaRDI QIDQ3565899FDOQ3565899
Authors: T. N. M. Malini Mai, P. Roushini Leely Pushpam
Publication date: 7 June 2010
Recommendations
Cited In (25)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On perfect Roman domination number in trees: complexity and bounds
- Global Roman domination in graphs
- A note on the edge Roman domination in trees
- Title not available (Why is that?)
- Minimal and maximal \(e=1\) functions
- An algorithm to recognize weak roman domination stable trees under vertex deletion
- Effect of vertex deletion on the weak Roman domination number of a graph
- Title not available (Why is that?)
- Edge lifting and Roman domination in graphs
- Title not available (Why is that?)
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Edge Roman domination on graphs
- Title not available (Why is that?)
- Varieties of Roman Domination
- Bounds on the locating Roman domination number in trees
- Secure vertex cover of a graph
- Roman edge domination in graphs
- Smarandachely Roman edge \(s\)-dominating function
- On the strong Roman domination number of graphs
- On the Roman edge domination number of a graph
- Weak edge Roman domination in graphs
- Outer-independent total Roman domination in graphs
- Title not available (Why is that?)
This page was built for publication: Edge roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565899)