Total domination multisubdivision number of a graph

From MaRDI portal
Publication:2344019

DOI10.7151/DMGT.1798zbMATH Open1311.05143arXiv1309.7228OpenAlexW2962754426MaRDI QIDQ2344019FDOQ2344019


Authors: Diana Avella-Alaminos, Rita Zuazua, Magda Dettlaff, Magdalena Lemańska Edit this on Wikidata


Publication date: 11 May 2015

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Abstract: The domination multisubdivision number of a nonempty graph G was defined as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msdgammat(G) of a graph G and we show that for any connected graph G of order at least two, msdgammat(G)leq3. We show that for trees the total domination multisubdivision number is equal to the known total domination subdivision number. We also determine the total domination multisubdivision number for some classes of graphs and characterize trees T with msdgammat(T)=1.


Full work available at URL: https://arxiv.org/abs/1309.7228




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Total domination multisubdivision number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344019)