3-tuple total domination number of Rook's graphs (Q2062669): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.7151/dmgt.2242 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2977922799 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1807.08104 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vizing's conjecture: a survey and recent results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On integer domination in graphs and Vizing-like problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5442178 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3110110 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3581931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on total and paired domination of Cartesian product graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer domination of Cartesian product graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality related to Vizing's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fractional domination of strong direct products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552196 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / 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: \(k\)-tuple total domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the total domination number of Cartesian products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3620551 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3014362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the \(\{k\}\)-domination number of Cartesian products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4523707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cartesian product graphs and k-tuple total domination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.7151/DMGT.2242 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:30, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | 3-tuple total domination number of Rook's graphs |
scientific article |
Statements
3-tuple total domination number of Rook's graphs (English)
0 references
3 January 2022
0 references
The paper is well written, readable and the mathematical aspect of the content is commendable. The paper discusses the concept of \(k\)-tuple total dominating set (kTDS) of a graph \(G\); which is the subset of the vertex set of graph \(G\), in which every vertex in \(G\) is adjacent to at least \(k\) vertices in \(S\). The minimum size of a kTDS is the \(k\)-tuple total dominating number denoted by \(\gamma_{X3,t}(K_n \square K_m)\) for all \(n \ge m\). The authors establish a general formula for \(\gamma_{X3,t}(K_n \square K_m)\) for all \(n \ge m\) and, provide a constructive proof for the formula.
0 references
total domination
0 references
Rooks graph
0 references