Important: The networks package has been deprecated.Use the superseding command GraphTheory[Graph] instead.

This procedure generates void graphs, i.e. graphs with n vertices and no edges. (Specific vertices may be provided as a set.) It is normally loaded via the command with(networks) but may also be referenced using the full name networks[void](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$G≔\mathrm{void}\left(10\right)\:$

$\mathrm{vertices}\left(G\right)$

$\left\{1\,2\,3\,4\,5\,6\,7\,8\,9\,10\right\}$

$\mathrm{edges}\left(G\right)$

$\varnothing$

$\mathrm{show}\left(\mathrm{void}\left(\left\{\mathrm{zurich}\,\mathrm{saskatchewan}\,\mathrm{waterloo}\right\}\right)\right)$

$table\left(\left[\mathrm{\_Econnectivity}=\mathrm{\_Econnectivity}\,\mathrm{\_Neighbors}=table\left(\left[\mathrm{waterloo}=\varnothing \,\mathrm{zurich}=\varnothing \,\mathrm{saskatchewan}=\varnothing \right]\right)\,\mathrm{\_Vweight}=table\left(\mathrm{sparse}\,\left[\right]\right)\,\mathrm{\_Counttrees}=\mathrm{\_Counttrees}\,\mathrm{\_Edges}=\varnothing \,\mathrm{\_Vertices}=\left\{\mathrm{zurich}\,\mathrm{saskatchewan}\,\mathrm{waterloo}\right\}\,\mathrm{\_Countcuts}=\mathrm{\_Countcuts}\right]\right)$