Semantic Scholar Open Access 2012 49 sitasi

On the Roman domination in the lexicographic product of graphs

T. K. Sumenjak P. Pavlic Aleksandra Tepeh

Abstrak

A Roman dominating function of a graph G=(V,E) is a function f:V->{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)[email protected]?"v"@?"Vf(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.

Topik & Kata Kunci

Computer Science Mathematics

Penulis (3)

T. K. Sumenjak

P. Pavlic

Aleksandra Tepeh

Format Sitasi

APA MLA BibTeX

Sumenjak, T.K., Pavlic, P., Tepeh, A. (2012). On the Roman domination in the lexicographic product of graphs. https://doi.org/10.1016/j.dam.2012.04.008

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.1016/j.dam.2012.04.008

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Total Sitasi: 49×
Sumber Database: Semantic Scholar
DOI: 10.1016/j.dam.2012.04.008
Akses: Open Access ✓