Total roman domination number of graphs
Total roman domination number of graphs
In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any minimal total roman dominating function f. The operation of vertex removal has been considered. A necessary and sufficient condition under which the total roman domination number increases (under this operation) has been proved. Similarly a necessary and sufficient condition has been proved under which the total roman domination number decreases. Some examples has been given with miscellaneous results. We characterize those graphs for which the total roman domination number is equal to the number of vertices of the graph. Publisher's Version
- ISIK UNIVERSITY Turkey
Total roman domination number, Minimal total roman dominating function, Total dominating set, Minimum total roman dominating function, Total roman dominating function
Total roman domination number, Minimal total roman dominating function, Total dominating set, Minimum total roman dominating function, Total roman dominating function
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!