next up previous
Next: Adjacency Up: Representation and Utilities Previous: Tree Representation

Edgeless Graphs

For the sake of convenience, we define $\mathit{Edgeless}(n)$ as the $n \times n$ matrix in which every element is zero. In terms of a graph, this means a graph of $n$ vertices with no edges.



Joshua Taylor 2005-04-27