Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...
Forbes contributors publish independent expert analyses and insights. I write about blockchain and big data, primarily focusing on XRP. The third part in series on how graph databases can be used to ...
A map f : V → {0, 1, 2} is a Roman dominating function on a graph G = (V, E) if for every vertex v ∈ V with f(v) = 0, there exists a vertex u, adjacent to v, such that f(u) = 2. The weight of a Roman ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback