A proof of a conjecture on the differential of a subcubic graph
From MaRDI portal
Publication:2004071
DOI10.1016/J.DAM.2020.07.018zbMath1448.05152OpenAlexW3077284658WikidataQ123247952 ScholiaQ123247952MaRDI QIDQ2004071
Mustapha Chellali, Lutz Volkmann, Rana Khoeilar, Seyyed Mahmoud Sheikholeslami, Hossein Karami
Publication date: 14 October 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.07.018
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorics for smaller kernels: the differential of a graph
- Lower bounds on the differential 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
- Roman Domination in Graphs
- Varieties of Roman domination II
- The differential of the strong product graphs
This page was built for publication: A proof of a conjecture on the differential of a subcubic graph