Semantic Scholar Open Access 2020 21 sitasi

Double domination in lexicographic product graphs

Abel Cabrera Martínez Suitberto Cabrera García J. A. Rodríguez-Velázquez

Lihat Sumber DOI

Abstrak

Abstract In a graph G , a vertex dominates itself and its neighbours. A subset S ⊆ V ( G ) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G ∘ H in terms of invariants of the factor graphs G and H .

Topik & Kata Kunci

Computer Science Mathematics

Penulis (3)

Abel Cabrera Martínez

Suitberto Cabrera García

J. A. Rodríguez-Velázquez

Format Sitasi

APA MLA BibTeX

Martínez, A.C., García, S.C., Rodríguez-Velázquez, J.A. (2020). Double domination in lexicographic product graphs. https://doi.org/10.1016/j.dam.2020.03.045

Akses Cepat

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

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Total Sitasi: 21×
Sumber Database: Semantic Scholar
DOI: 10.1016/j.dam.2020.03.045
Akses: Open Access ✓