On the differential and Roman domination number of a graph with minimum degree two
From MaRDI portal
Publication:2410222
DOI10.1016/j.dam.2017.08.005zbMath1372.05157OpenAlexW2755053059MaRDI QIDQ2410222
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.08.005
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (7)
On the perfect differential of a graph ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ Differential in complementary prisms ⋮ On the differential polynomial of a graph ⋮ From the strong differential to Italian domination in graphs ⋮ Roman Domination in Graphs ⋮ \(\beta\)-differential of a graph
Cites Work
- Roman domination on strongly chordal graphs
- Combinatorics for smaller kernels: the differential of a graph
- Lower bounds on the differential of a graph
- Upper bounds on Roman domination numbers of graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Computing the differential of a graph: hardness, approximability and exact algorithms
- The differential and the roman domination number of a graph
- Domination in graphs with minimum degree two
- Extremal Problems for Roman Domination
- Paths, Stars and the Number Three
- The differential of the strong product graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the differential and Roman domination number of a graph with minimum degree two
