The Signed Total Roman k-Domatic Number Of A Graph

Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is adjacent to at least one vertex w for which f(w...

全面介紹

書目詳細資料

主要作者:	Volkmann Lutz
格式:	Artigo
語言:	Inglês
出版:	University of Zielona Góra 2017-11-01
叢編:	Discussiones Mathematicae Graph Theory
主題:	signed total roman k-dominating function signed total roman k-domination number signed total roman k-domatic number.
在線閱讀:	https://doi.org/10.7151/dmgt.1970
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!