On the Roman domination in the lexicographic product of graphs

Tadeja Kraner Šumenjak (Avtor), Polona Pavlič (Avtor), Aleksandra Tepeh (Avtor)

Povzetek

A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f \colon V \to \{0,1,2\}$▫ such that every vertex with ▫$f(v) = 0$▫ is adjacent to some vertex with ▫$f(v) = 2$▫. The Roman domination number of ▫$G$▫ is the minimum of ▫$w(f) = \sum_{v \in V}f(v)$▫ over all such functions. Using a new concept of the so-called dominating couple we establish the Roman domination number of the lexicographic product of graphs. We also characterize Roman graphs among the lexicographic product of graphs.

Ključne besede

teorija grafov;rimska dominacija;popolna dominacija;leksikografski produkt;graph theory;Roman domination;total domination;lexicographic product;

Podatki

Jezik:	Angleški jezik
Leto izida:	2012
Tipologija:	1.01 - Izvirni znanstveni članek
Organizacija:	UM FNM - Fakulteta za naravoslovje in matematiko
UDK:	519.17
COBISS:	3345708
ISSN:	0166-218X
Št. ogledov:	1121
Št. prenosov:	92
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Angleški jezik
URN:	URN:SI:UM:
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 2030-2036
Letnik:	ǂLetn. ǂ160
Zvezek:	ǂiss. ǂ13-14
Čas izdaje:	2012
ID:	1471813