Returns the adjacency matrix for the (p, q) graph G as an element of the matrix ring Mp(Z).
Returns the distance matrix A for the (p, q) graph G as an element of the matrix ring Mp(Z). The (i, j)-th entry of A gives the distance between vertices vi and vj of G.
Returns the incidence matrix M for the (p, q) graph G as an element of the matrix bimodule Mp x q(Z).If G is a graph, then entry (i, j) of M is 1 if the vertex vi of G lies on the edge ej of G. Otherwise entry (i, j) is zero.
If G is a digraph, entry (i, j) of M is 1 if vertex vi is the initial vertex of the edge ej, and -1 if vi is the final vertex of the edge ej. Otherwise entry (i, j) is zero. If ej is a loop, then entry (i, j) may be either 1 or -1.
Given an ordered equitable partition P = P1 ∪P2 ∪ ... ∪Pr of the vertex-set of the graph G, return the intersection matrix T for the partition. Thus, entry T[i, j] is the number of vertices of the set Pj that are adjacent to a vertex of the set Pi.