Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs |
scientific article; zbMATH DE number 7610736
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs |
scientific article; zbMATH DE number 7610736 |
Statements
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (English)
0 references
2 November 2022
0 references
open-locating-dominating set
0 references
open-independent set
0 references
complementary prism
0 references
0 references
