graphic(E, V, R)
graphic(E, R)
graphic(E, V)
graphic E
A graph $G$ is specified by a list $V$ of vertices and a list $E$ of pairs of vertices. When $V$ is not specified, it is assumed to be the list $1, 2, \ldots, n$, where $n$ is the largest integer appearing as a vertex of $E$. The graphic arrangement $A(G)$ of $G$ is the subarrangement of the type $A_{n-1}$ arrangement with hyperplanes $x_i-x_j$ for each edge $\{i,j\}$ of the graph $G$.
|
|
|
|
One can also specify the ambient ring.
|
|
Occasionally, one might want to give labels to the vertices. These labels can be anything!
|
|
|
The vertices can also be the variables of a polynomial ring.
|
|
|
Loops and parallel edges are allowed.
|
|