Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Locating Roman domination in graphs

From MaRDI portal
Publication:5206590
Jump to:navigation, search

zbMATH Open1427.05168MaRDI QIDQ5206590FDOQ5206590


Authors: Nader Jafari Rad, Hadi Rahbani, Lutz Volkmann Edit this on Wikidata


Publication date: 18 December 2019





Recommendations

  • Bounds on the locating Roman domination number in trees
  • Roman domination in graphs.
  • A characterization of Roman trees
  • On the Roman bondage number of a graph
  • On the Roman domination subdivision number of a graph


zbMATH Keywords

Roman domination numberlocating domination number


Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)



Cited In (5)

  • Isolate Roman domination in graphs
  • Algorithmic aspects of Roman graphs
  • Bounds on the locating Roman domination number in trees
  • Resolving Roman domination in graphs
  • Varieties of Roman domination. II





This page was built for publication: Locating Roman domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206590)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5206590&oldid=19801658"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 17:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki