Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
S.M. Sheikholeslami
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Lower and upper bounds on independent double Roman domination in trees M. Kheibari; Hossein Abdollahzadeh Ahangar; R. Khoeilar; S.M. Sheikholeslami
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2022.10.2.8

Abstract

For a graph G = (V, E), a double Roman dominating function (DRDF) f : V → {0, 1, 2, 3} has the property that for every vertex v ∈ V with f(v)=0, either there exists a neighbor u ∈ N(v), with f(u)=3, or at least two neighbors x, y ∈ N(v) having f(x)=f(y)=2, and every vertex with value 1 under f has at least a neighbor with value 2 or 3. The weight of a DRDF is the sum f(V)=∑v ∈ Vf(v). A DRDF f is an independent double Roman dominating function (IDRDF) if the vertices with weight at least two form an independent set. The independent double Roman domination number idR(G) is the minimum weight of an IDRDF on G. In this paper, we show that for every tree T with diameter at least three, i(T)+iR(T)−(s(T))/2 + 1 ≤ idR(T)≤i(T)+iR(T)+s(T)−2, where i(T),iR(T) and s(T) are the independent domination number, the independent Roman domination number and the number of support vertex of T, respectively.
Co-Authors Hossein Abdollahzadeh Ahangar M. Kheibari R. Khoeilar