Double Roman reinforcement number in graphs
For a graph a double Roman dominating function is a function having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then vertex v must have at least one neighbor w with The weight of a double Roman dom...
Enregistré dans:
Auteurs principaux: | J. Amjadi, H. Sadeghi |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Taylor & Francis Group
2021
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/891302961fe3473ebd5cfcd180741879 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
On the Quasi-Total Roman Domination Number of Graphs
par: Abel Cabrera Martínez, et autres
Publié: (2021) -
The total double geodetic number of a graph
par: Santhakumaran,A. P., et autres
Publié: (2020) -
Upper double monophonic number of a graph
par: Santhakumaran,A. P., et autres
Publié: (2018) -
On graphs whose chromatic transversal number is two
par: Ayyaswamy,S.K, et autres
Publié: (2011) -
On the (M, D) number of a graph
par: John,J., et autres
Publié: (2019)