Zobrazeno 1 - 10
of 351
pro vyhledávání: '"Roman domination number"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 171-180 (2024)
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighb
Externí odkaz:
https://doaj.org/article/f610d32aab714c718a924f3a453e94c9
Publikováno v:
AIMS Mathematics, Vol 9, Iss 1, Pp 594-606 (2024)
Latin square, also known as Latin square matrix, refers to a kind of $ n\times n $ matrix, in which there are exactly $ n $ different symbols and each symbol appears exactly once in each row and column. A Latin square graph $ \Gamma(L) $ is a simple
Externí odkaz:
https://doaj.org/article/626e14c15c324e98baac8bfcb032fdce
Publikováno v:
AIMS Mathematics, Vol 8, Iss 8, Pp 17702-17718 (2023)
Let $ G = (V, E) $ be a simple graph with vertex set $ V $ and edge set $ E $, and let $ f $ be a function $ f:V\mapsto \{0, 1, 2\} $. A vertex $ u $ with $ f(u) = 0 $ is said to be undefended with respect to $ f $ if it is not adjacent to a vertex w
Externí odkaz:
https://doaj.org/article/4250501daad34f9090e4e769b9eac48c
Let $k$ be a positive integer. A {\em Roman $k$-dominating function} on a graph $G$ is a labeling $f:V (G)\longrightarrow \{0, 1, 2\}$ such that every vertex with label 0 has at least $k$ neighbors with label 2. A set $\{f_1,f_2,\ldots,f_d\}$ of dist
Externí odkaz:
http://arxiv.org/abs/2003.09272
Publikováno v:
پژوهشهای ریاضی, Vol 8, Iss 3, Pp 80-90 (2022)
Externí odkaz:
https://doaj.org/article/7d6f6964e8774cd785a08419d0fa0e62
Publikováno v:
Transactions on Combinatorics, Vol 12, Iss 1, Pp 1-10 (2023)
Chemical study regarding total $\pi$-electron energy with respect to conjugated molecules has focused on the second Zagreb index of graphs. Moreover, in the last half-century, it has gotten a lot of attention. The relationship between the Roman domin
Externí odkaz:
https://doaj.org/article/1b00105e64094510b3e5d7ac9e91cf00
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 73-78 (2023)
AbstractIn this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 t
Externí odkaz:
https://doaj.org/article/55042796e9fa4f6b9e66af0659a62c77
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 1-8 (2023)
AbstractA quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isol
Externí odkaz:
https://doaj.org/article/400dc800a3574cdbb56d64a6ca4ba8d8
Autor:
Huiqin Jiang, Zehui Shao
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 221-228 (2022)
AbstractA quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isol
Externí odkaz:
https://doaj.org/article/e2fd17de9b194b4899d364ebb9413507