Further results on outer independent triple Roman domination
An outer-independent triple Roman dominating function (OI[3]RDF) on a graph [Formula: see text] is function [Formula: see text] having the property that (i) if [Formula: see text] then v must have either a neighbor assigned 4 or two neighbors one of which is assigned 3 and the other at least 2 or v...
Saved in:
| Main Authors: | F. Najafi, J. Amjadi, S. M. Sheikholeslami, M. Chellali, S. Kosari |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2421988 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Total Version of Triple Roman Domination in Graphs
by: Juan Carlos Valenzuela-Tripodoro, et al.
Published: (2025-04-01) -
Signed total double Roman dominating functions in graphs
by: L. Shahbazi, et al.
Published: (2024-09-01) -
More results on the signed double Roman domination number of graphs
by: Seyed Mahmoud Sheikholeslami, et al.
Published: (2025-06-01) -
Further Results on Generous Roman Domination
by: Seyed Mahmoud Sheikholeslami, et al.
Published: (2025-06-01) -
RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS
by: Saeed Kosari, et al.
Published: (2022-12-01)