A proof of a conjecture on the paired-domination subdivision number
From MaRDI portal
Publication:2117538
DOI10.1007/S00373-022-02472-4zbMATH Open1485.05141OpenAlexW4220850532WikidataQ113905206 ScholiaQ113905206MaRDI QIDQ2117538FDOQ2117538
Authors: Zehui Shao, Mustapha Chellali, Seyed Mahmood Sheikholeslami, R. Khoeilar, Hossein Karami 
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02472-4
Recommendations
Cites Work
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bounds on the paired domination subdivision number of a graph
- Paired-domination subdivision numbers of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in inflated graphs
- Paired-domination number of a graph and its complement
- Paired-domination game played in graphs
- Complexity of the paired domination subdivision problem
Cited In (5)
This page was built for publication: A proof of a conjecture on the paired-domination subdivision number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117538)
