Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:46, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the open \(k\)-monopoly number of strong product graphs |
scientific article |
Statements
Bounding the open \(k\)-monopoly number of strong product graphs (English)
0 references
10 January 2018
0 references
open monopolies
0 references
strong product graphs
0 references
alliances
0 references
domination
0 references
