Semantic Scholar Open Access 2019 27 sitasi

Total Roman domination in the lexicographic product of graphs

Nicolás Campanelli D. Kuziak

Lihat Sumber DOI

Abstrak

Abstract A total Roman dominating function of a graph G = ( V , E ) is a function f : V ( G ) → { 0 , 1 , 2 } such that for every vertex v with f ( v ) = 0 there exists a vertex u adjacent to v with f ( u ) = 2 , and such that the subgraph induced by the set of vertices labeled one or two has no isolated vertices. The total Roman domination number of G is the minimum value of the sums ∑ v ∈ V f ( v ) over all total Roman dominating functions f of G . In this paper we study the total Roman domination number of the lexicographic product of graphs.

Topik & Kata Kunci

Computer Science Mathematics

Penulis (2)

Nicolás Campanelli

D. Kuziak

Format Sitasi

APA MLA BibTeX

Campanelli, N., Kuziak, D. (2019). Total Roman domination in the lexicographic product of graphs. https://doi.org/10.1016/J.DAM.2018.06.008

Akses Cepat

Lihat di Sumber doi.org/10.1016/J.DAM.2018.06.008

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Total Sitasi: 27×
Sumber Database: Semantic Scholar
DOI: 10.1016/J.DAM.2018.06.008
Akses: Open Access ✓