Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

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 ...

This is a preview. Log in through your library . Abstract In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this ...

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 ...