One can use subgraph I_nm
and subgraph C_n
, is there a complete list? In particular I'm looking for a linear subgraph, but a complete list would be extremely helpful.
I just found this in the documentation:
The library graphs.standard defines a number of such graphs, including the complete clique Kn on n nodes, the complete bipartite graph Kn,m with shores sized n and m, the cycle Cn on n nodes, the path Pn on n nodes, and the independent set In on n nodes.
Which does not appear to be a complete list, but maybe it is!
Best Answer
Are you looking for §19.10.1 Graph Macros in the manual? Here’s a list:
I_n
independent setI_nm
two-shore independent setK_n
complete cliqueK_nm
complete bipartite graphC_n
cycleP_n
pathGrid_n
gridIf you look at the source code, however, you’ll notice this undocumented macro:
G_np
random (undirected) graph according to the Gn,p model (for each pair of vertices, there is an edge between them with probability p)For example: