K-tuple total domination in inflated graphs

From MaRDI portal
Publication:5259449

DOI10.2298/FIL1302341KzbMATH Open1409.05150arXiv1105.2404MaRDI QIDQ5259449FDOQ5259449

A. P. Kazemi

Publication date: 26 June 2015

Published in: Filomat (Search for Journal in Brave)

Abstract: The inflated graph GI of a graph G with n(G) vertices is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorph to the complete graph Kd, and each edge (xi,xj) of G is replaced by an edge (u,v) in such a way that uinXi, vinXj, and two different edges of G are replaced by non-adjacent edges of GI. For integer kgeq1, the k-tuple total domination number gammaimesk,t(G) of G is the minimum cardinality of a k-tuple total dominating set of G, which is a set of vertices in G such that every vertex of G is adjacent to at least k vertices in it. For existing this number, must the minimum degree of G is at least k. Here, we study the k-tuple total domination number in inflated graphs when kgeq2. First we prove that n(G)kleqgammaimesk,t(GI)leqn(G)(k+1)1, and then we characterize graphs G that the k-tuple total domination number number of GI is n(G)k or n(G)k+1. Then we find bounds for this number in the inflated graph GI, when G has a cut-edge e or cut-vertex v, in terms on the k-tuple total domination number of the inflated graphs of the components of Ge or v-components of Gv, respectively. Finally, we calculate this number in the inflated graphs that have obtained by some of the known graphs.


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






Cited In (3)






This page was built for publication: K-tuple total domination in inflated graphs

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