\(k\)-tuple total domination in complementary prisms (Q410666): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2011/681274 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079681467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination and total domination in complementary prisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5441572 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(k\)-tuple total domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(k\)-tuple total domination in cross products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3423068 / rank | |||
Normal rank |
Latest revision as of 01:45, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(k\)-tuple total domination in complementary prisms |
scientific article |
Statements
\(k\)-tuple total domination in complementary prisms (English)
0 references
3 April 2012
0 references
Summary: Let \(k\) be a positive integer, and let \(G\) be a graph with minimum degree at least \(k\). In their study \textit{M. A. Henning} and \textit{A. P. Kazemi} [Discrete Appl. Math. 158, No. 9, 1006--1011 (2010; Zbl 1210.05097)] defined the \(k\)-tuple total domination number \(\gamma_{\times k,t}(G)\) of \(G\) as the minimum cardinality of a \(k\)-tuple total dominating set of \(G\), which is a vertex set such that every vertex of \(G\) is adjacent to at least \(k\) vertices in it. If \(\overline G\) is the complement of \(G\), the complementary prism \(G \overline G\) of \(G\) is the graph formed from the disjoint union of \(G\) and \(\overline G\) by adding the edges of a perfect matching between the corresponding vertices of \(G\) and \(\overline G\). In this paper, we extend some of the results of \textit{T. W. Haynes} et al. [Bull. Inst. Comb. Appl. 51, 21--30 (2007; Zbl 1155.05051)] for the \(k\)-tuple total domination number and also obtain some other new results. Also we find the \(k\)-tuple total domination number of the complementary prism of a cycle, a path, or a complete multipartite graph.
0 references
total dominating set
0 references
\(k\)-tuple total domination number
0 references