The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The secure domination number of Cartesian products of small graphs with paths and cycles |
scientific article |
Statements
The secure domination number of Cartesian products of small graphs with paths and cycles (English)
0 references
13 January 2022
0 references
In the paper, secure domination numbers of Cartesian products \(P_2\square P_n\), \(P_3\square P_n\), \(P_2\square C_n\), \(P_3\square C_n\) and Möbius ladder graphs \(M_{2n}\) are determined exactly using elementary combinatorial reasoning.
0 references
secure domination
0 references
paths
0 references
cycles
0 references
Cartesian product
0 references
