QR Code

On trees with equal Roman domination and outer-independent Roman domination number

A Roman dominating function (RDF) on a graph $G$ is a function $f : V (G) \to \{0, 1, 2\}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$. A Roman dominating function $f$ is called an outer-independent Roman dominati...

Whakaahuatanga katoa

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua: S. Nazari-Moghaddam, S.M. Sheikholeslami
Hōputu: Artigo
Reo:Inglês
I whakaputaina: Azarbaijan Shahide Madani University 2019-12-01
Rangatū:Communications in Combinatorics and Optimization
Ngā marau:
Urunga tuihono:http://comb-opt.azaruniv.ac.ir/article_13865_778d0f97a1447e3fa6dcc653002a9d16.pdf
Ngā Tūtohu: Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!