Progress on Roman and Weakly Connected Roman Graphs
A graph <i>G</i> for which <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>γ</mi><mi>R</mi></msub><mrow><mo>(</mo><mi>G<...
Main Authors: | Joanna Raczek, Rita Zuazua |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/16/1846 |
Similar Items
-
Total Weak Roman Domination in Graphs
by: Abel Cabrera Martínez, et al.
Published: (2019-06-01) -
Weak signed Roman k-domination in digraphs
by: Lutz Volkmann
Published: (2024-01-01) -
Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1
by: Jian Yang, et al.
Published: (2023-05-01) -
Some Results on the Strong Roman Domination Number of Graphs
by: Akram Mahmoodi, et al.
Published: (2020-09-01) -
The Distance Roman Domination Numbers of Graphs
by: Aram Hamideh, et al.
Published: (2013-09-01)