Efficient open domination in graph products
Efficient open domination in graph products
About this item
Full title
Author / Creator
Publisher
Nancy: DMTCS
Journal title
Language
English
Formats
Publication information
Publisher
Nancy: DMTCS
Subjects
More information
Scope and Contents
Contents
Graph Theory
A graph G is an efficient open domination graph if there exists a subset D of V(G) for which the open neighborhoods centered in vertices of D form a partition of V(G). We completely describe efficient open domination graphs among lexicographic, strong, and disjunctive products of graphs. For the Cartesian product we give a character...
Alternative Titles
Full title
Efficient open domination in graph products
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_6fe44ee4d9184d258deaa9b71e8894fe
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_6fe44ee4d9184d258deaa9b71e8894fe
Other Identifiers
ISSN
1365-8050,1462-7264
E-ISSN
1365-8050
DOI
10.46298/dmtcs.1267
