izvor podataka: crosbi
✓
Domination numbers of cardinal products (CROSBI ID 79391)
Prilog u časopisu | izvorni znanstveni rad
Klobučar, Antoaneta
Domination numbers of cardinal products // Mathematica slovaca, 49 (1999), 4; 387-402
Podaci o odgovornosti
Klobučar, Antoaneta
engleski
Domination numbers of cardinal products
For a graph G a subset of the vertex set of G is called dominating set if every vertex x not in D, is adjacent to at least one vertex of D. The domination number is the cardinality of a smallest dominating set.. In this paper we determine the domination numbers of P_2 X P_n, P_3 X P_n, P_4 X P_n and P_5 X P_n, where X denotes the cardinal product.
graph dominating set; cardinal product
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano