On domination multisubdivision number of unicyclic graphs

Opuscula Mathematica

Joanna Raczek¹ 

[1] Gdansk University of Technology, Department of Technical Physics and Applied Mathematics, Narutowicza 11/12, 80–233 Gdańsk, Poland;

关键词: domination number;    domination subdivision number;    domination multisubdivision number;    trees;    unicyclic graphs;   

DOI  :  https://doi.org/10.7494/OpMath.2018.38.3.409

来源: DOAJ

【 摘 要 】

The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number oftrees, Discrete Math. 309 (2009), 622-628], we constructively characterize all connected unicyclic graphs with the domination multisubdivision number equalto 3. We end with further questions and open problems.

【 授权许可】

Unknown