Trees with independent Roman domination number twice the independent domination number
A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text]. The weight of a RDF [Formula: see text] is the value [Formula: see text]. The Roman domination number, [Formula: see text], of [Formula: see text] is the minimum weight of a RDF on [Formula: see text]. An RDF [Formula: see text] is called an independent Roman dominating function (IRDF) if the set [Formula: see text] is an independent set. The independent Roman domination number, [Formula: see text], is the minimum weight of an IRDF on [Formula: see text]. In this paper, we study trees with independent Roman domination number twice their independent domination number, answering an open question.
Top-30
Journals
|
1
2
3
|
|
|
Discrete Mathematics, Algorithms and Applications
3 publications, 50%
|
|
|
IEEE Access
1 publication, 16.67%
|
|
|
Developments in Mathematics
1 publication, 16.67%
|
|
|
Quaestiones Mathematicae
1 publication, 16.67%
|
|
|
1
2
3
|
Publishers
|
1
2
3
|
|
|
World Scientific
3 publications, 50%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
1 publication, 16.67%
|
|
|
Springer Nature
1 publication, 16.67%
|
|
|
Taylor & Francis
1 publication, 16.67%
|
|
|
1
2
3
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.