A proof of a conjecture on the differential of a subcubic graph
DOI10.1016/J.DAM.2020.07.018zbMATH Open1448.05152OpenAlexW3077284658WikidataQ123247952 ScholiaQ123247952MaRDI QIDQ2004071FDOQ2004071
Authors: Mustapha Chellali, Lutz Volkmann, R. Khoeilar, Hossein Karami, Seyed Mahmood Sheikholeslami
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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Roman domination in graphs.
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Combinatorics for smaller kernels: the differential of a graph
- Differentials in graphs
- Lower bounds on the differential of a graph
- Roman domination in graphs
- The differential and the roman domination number of a graph
- On the differential in graphs
- Varieties of Roman domination. II
- The differential of the strong product graphs
Cited In (2)
This page was built for publication: A proof of a conjecture on the differential of a subcubic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004071)