Graph databases explicitly express the connections between nodes, and are more efficient at the analysis of networks (computer, human, geographic, or otherwise) than relational databases. There has ...
In this paper we continue the study of signed double Roman dominating functions in graphs. A signed double Roman dominating function (SDRDF) on a graph G = (V, E) is a function f : V(G) → {−1, 1, 2, 3 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback