QUOTE
The header line contains either two (n, m), three (n, m, fmt), or four (n, m, fmt, ncon) parameters. The first two
parameters (n, m) are the number of vertices and the number of edges, respectively. Note that in determining the
number of edges m, an edge between any pair of vertices v and u is counted only once and not twice (i.e., we do not
count the edge (v; u) separately from (u; v)). For example, the graph in Figure 2 contains 11 vertices.
UNQUOTE
I am sure the very last word - vertices - should read "edges".
It is on p.9:
QUOTE The header line contains either two (n, m), three (n, m, fmt), or four (n, m, fmt, ncon) parameters. The first two parameters (n, m) are the number of vertices and the number of edges, respectively. Note that in determining the number of edges m, an edge between any pair of vertices v and u is counted only once and not twice (i.e., we do not count the edge (v; u) separately from (u; v)). For example, the graph in Figure 2 contains 11 vertices. UNQUOTE
I am sure the very last word - vertices - should read "edges".