Efficient open domination in graph products

Dorota Kuziak (Author), Iztok Peterin (Author), Ismael G. Yero (Author)

Abstract

Graf ▫$G$▫ je optimalno odprto dominiran, če obstaja podmnožica ▫$D$▫ množice ▫$V(G)$▫, za katero odprte okolice s centrom v vozliščih iz ▫$D$▫ tvorijo razbitje množice ▫$V(G)$▫. Popolnima opišemo optimalne odprto dominirane grafe za leksikografski, krepki in disjunktni produkt grafov. Za kartezični produkt predstavimo karakterizacijo, kjer je en faktor ▫$K_2$▫.

Keywords

teorija grafov;optimalna odprta dominacija;grafovski produkti;popolna dominacija;graph theory;efficient open domination;graph products;total domination;

Data

Language:	English
Year of publishing:	2014
Typology:	1.01 - Original Scientific Article
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
UDC:	519.17
COBISS:	16916057
ISSN:	1365-8050
Views:	766
Downloads:	107
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Slovenian
Secondary title:	Optimalna odprta dominacija in grafovski produkti
Secondary abstract:	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 characterization when one factor is ▫$K_2$▫.
Secondary keywords:	teorija grafov;optimalna odprta dominacija;grafovski produkti;popolna dominacija;
URN:	URN:SI:UM:
Type (COBISS):	Scientific work
Pages:	str. 105-120
Volume:	ǂVol. ǂ16
Issue:	ǂno. ǂ1
Chronology:	2014
ID:	10847394