On roman, global and restrained domination in graphs
From MaRDI portal
Publication:659738
DOI10.1007/S00373-010-0992-ZzbMATH Open1234.05180arXiv0901.2862OpenAlexW2085620810MaRDI QIDQ659738FDOQ659738
Authors: Vadim Zverovich, Anush Poghosyan 
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination number is equal to the domination number, and the total restrained domination number is equal to the total domination number. A number of open problems are posed.
Full work available at URL: https://arxiv.org/abs/0901.2862
Recommendations
Cites Work
- On the ratio of optimal integral and fractional covers
- Roman domination in graphs.
- Transversal numbers of uniform hypergraphs
- Title not available (Why is that?)
- On the domination number of a random graph
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Factor domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Title not available (Why is that?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- Degree sequences of random graphs
- Total restrained domination in graphs with minimum degree two
- Title not available (Why is that?)
- Almost all Graphs have a Spanning Cycle
Cited In (19)
- Title not available (Why is that?)
- Hardness results of global Roman domination in graphs
- Global Roman domination in graphs
- Some new results on global dominating sets
- Global Roman domination in trees
- Roman Domination in Graphs
- Weighted restrained domination in subclasses of planar graphs
- On the global Roman domination number in graphs
- Title not available (Why is that?)
- Global triple Roman dominating function
- Global italian domination in graphs
- Global double Roman domination in graphs
- THE GLOBAL EQUITABLE DOMINATION IN GRAPHS
- Global Domination
- Linear programming approach for various domination parameters
- The Roman domination number of some special classes of graphs - convex polytopes
- Title not available (Why is that?)
- The extended dominating sets in graphs
- On the global double Roman domination of graphs
This page was built for publication: On roman, global and restrained domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659738)
