next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
NautyGraphs
::
relabelBipartite
relabelBipartite -- relabels a bipartite graph so all vertices of a given class are contiguous
Synopsis
Usage:
L' = relabelBipartite L
T = relabelBipartite S
H = relabelBipartite G
Inputs:
L
,
a
list
, a list of bipartite graphs in various formats
S
,
a
string
, a bipartite graph encoded in either Sparse6 or Graph6 format
G
,
an object of class
Graph
, a bipartite graph
Outputs:
L'
,
a
list
, a list of graphs isomorphic to
S
T
,
a
string
, a graph isomorphic to
S
encoded in either Sparse6 or Graph6 format
H
,
an object of class
Graph
, a graph isomorphic to
G
Description
A bipartite graph can be labeled so all vertices of a given class are contiguous. This method does precisely that to a bipartite graph.
G = graph {{1,2},{1,4},{1,6},{3,2},{3,4},{3,6},{5,2},{5,4},{5,6}};
relabelBipartite G
If any of the inputs are not bipartite graphs, then the method throws an error.
See also
relabelGraph
-- applies a vertex invariant based refinement to a graph
Ways to use
relabelBipartite
:
relabelBipartite(Graph)
relabelBipartite(List)
relabelBipartite(String)