Abstract: Coloring a graph is a known and a classical problem in graph theory. It is also a known NP problem. In a graph G, the solution of coloring a graph is about coloring all the vertices of the ...

Currently, the project supports binary spatial weights in the construction of the adjacency matrix (e.g., 0-1 weights). We introduce support for continuous spatial weights in the adjacency matrix, ...

Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...

Abstract: Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as ...