A proof of a conjecture on the paired-domination subdivision number
From MaRDI portal
Publication:2117538
DOI10.1007/s00373-022-02472-4zbMath1485.05141OpenAlexW4220850532WikidataQ113905206 ScholiaQ113905206MaRDI QIDQ2117538
Zehui Shao, Mustapha Chellali, Rana Khoeilar, Hossein Karami, Seyyed Mahmoud Sheikholeslami
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the paired domination subdivision number of a graph
- Paired-domination in inflated graphs
- Paired-domination subdivision numbers of graphs
- Paired-domination number of a graph and its complement
- Paired-domination in graphs
- Paired-Domination Game Played in Graphs
- Complexity of the paired domination subdivision problem
This page was built for publication: A proof of a conjecture on the paired-domination subdivision number