Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new upper bound for the perfect Italian domination number of a tree

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

DOI10.7151/dmgt.2324zbMath1492.05119OpenAlexW3025704766MaRDI QIDQ2151228

Sakineh Nazari-Moghaddam, Mustapha Chellali

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2324


zbMATH Keywords

Roman dominationItalian dominationperfect Italian domination


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (1)

Approximation algorithm for (connected) Italian dominating function




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Roman \(\{2 \}\)-domination
  • Roman domination in graphs.
  • Perfect Roman domination in trees
  • Perfect Italian domination in trees
  • The Roman domatic problem in graphs and digraphs: a survey
  • On perfect Roman domination number in trees: complexity and bounds
  • Defendens Imperium Romanum: A Classical Problem in Military Strategy
  • Varieties of Roman Domination
  • Roman Domination in Graphs
  • Varieties of Roman domination II




This page was built for publication: A new upper bound for the perfect Italian domination number of a tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2151228&oldid=14656898"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 23:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki