On Roman balanced domination of graphs
Let $ G $ be a graph with vertex set $ V $. A function $ f $ : $ V\to \{-1, 0, 2\} $ is called a Roman balanced dominating function (RBDF) of $ G $ if $ \sum_{u\in N_G[v]}f(u) = 0 $ for each vertex $ v\in V $. The maximum (resp. minimum) Roman balanced domination number $ \gamma^{M}_{Rb}(G) $ (resp....
Saved in:
Main Authors: | Mingyu Zhang, Junxia Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-12-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241707 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Investıgatıon of Balance Performance in Soccer in Terms of Posıtıonal Dıfferences
by: Ömer Çalışkan, et al.
Published: (2023-08-01) -
Co-Secure Domination Number in Some Graphs
by: Jiatong Cui, et al.
Published: (2024-12-01) -
Perfectness of the essential graph for modules over commutative rings
by: Fatemeh Soheilnia, et al.
Published: (2025-02-01) -
Two Approaches to Constructing Certified Dominating Sets in Social Networks
by: Joanna Raczek, et al.
Published: (2025-01-01) -
The Impact of Modern Technologies on the Balance of Basketball Players with Ages between 13-14
by: N. Steff, et al.
Published: (2024-12-01)