TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
From MaRDI portal
Publication:2864851
DOI10.1142/S1793830913500092zbMath1276.05085OpenAlexW2162976033MaRDI QIDQ2864851
Odile Favaron, Rana Khoeilar, Seyyed Mahmoud Sheikholeslami
Publication date: 26 November 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830913500092
Related Items (1)
Cites Work
- Bounding the total domination subdivision number of a graph in terms of its order
- Paired-domination subdivision numbers of graphs
- Total outer-connected domination numbers of trees
- Total domination subdivision numbers of trees
- Characterization of double domination subdivision number of trees
- Total outer-connected domination in trees
- Total domination subdivision numbers of graphs
This page was built for publication: TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS