More results on the signed double Roman domination number of graphs
A signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a neighbor w with [Formula: see text] or two neighbors...
Saved in:
| Main Authors: | Seyed Mahmoud Sheikholeslami, Lutz Volkmann |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-06-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2025.2511651 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Signed total double Roman dominating functions in graphs
by: L. Shahbazi, et al.
Published: (2024-09-01) -
Further results on outer independent triple Roman domination
by: F. Najafi, et al.
Published: (2025-01-01) -
Further Results on Generous Roman Domination
by: Seyed Mahmoud Sheikholeslami, et al.
Published: (2025-06-01) -
On the Total Version of Triple Roman Domination in Graphs
by: Juan Carlos Valenzuela-Tripodoro, et al.
Published: (2025-04-01) -
RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS
by: Saeed Kosari, et al.
Published: (2022-12-01)