On the existence problem of the total domination vertex critical graphs

From MaRDI portal
Publication:617898

DOI10.1016/J.DAM.2010.09.004zbMATH Open1208.05103arXiv1001.0797OpenAlexW2017903984MaRDI QIDQ617898FDOQ617898


Authors: Moo Young Sohn, Young Soo Kwon, Jaeun Lee, Dongseok Kim Edit this on Wikidata


Publication date: 14 January 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: The existence problem of the total domination vertex critical graphs has been studied in a series of articles. The aim of the present article is twofold. First, we settle the existence problem with respect to the parities of the total domination number m and the maximum degree Delta : for even m except m=4, there is no m-gamma_t-critical graph regardless of the parity of Delta; for m=4 or odd m ge 3 and for even Delta, an m-gamma_t-critical graph exists if and only if Delta ge 2 lfloor frac{m-1}{2} floor; for m=4 or odd m ge 3 and for odd Delta, if Delta ge 2lfloor frac{m-1}{2} floor +7, then m-gamma_t-critical graphs exist, if Delta < 2lfloor frac{m-1}{2} floor, then m-gamma_t-critical graphs do not exist. The only remaining open cases are Delta = 2lfloor frac{m-1}{2} floor +k, k=1, 3, 5. Second, we study these remaining open cases when m=4 or odd m ge 9. As the previously known result for m = 3, we also show that for Delta(G)= 3, 5, 7, there is no 4-gamma_t-critical graph of order Delta(G)+4. On the contrary, it is shown that for odd m ge 9 there exists an m-gamma_t-critical graph for all Delta ge m-1.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On the existence problem of the total domination vertex critical graphs

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