Documentation

graph
- A General Facility (GRAPHS)
- Access functions (GRAPHS)
- Adding Edges (GRAPHS)
- Adding Vertices (GRAPHS)
- Adjacency and Degree Functions for a Graph (GRAPHS)
- Automorphism Group of a Graph or Digraph (GRAPHS)
- Bounds on the Graph Order (GRAPHS)
- Connectedness in a Graph (GRAPHS)
- Connectedness in a Multigraph (MULTIGRAPHS)
- Constructing Complements, Line Graphs; Contraction, Switching (GRAPHS)
- Construction of a General Graph (GRAPHS)
- Construction of a Standard Graph (GRAPHS)
- Construction of Graphs and Digraphs (GRAPHS)
- Converting between Graphs and Digraphs (GRAPHS)
- Creation of Small Graph Databases (GRAPHS)
- Distances, Paths and Circuits in a Graph (GRAPHS)
- Distances, Paths and Circuits in a Non-Weighted Graph (GRAPHS)
- Distances, Paths and Circuits in a Possibly Weighted Graph (GRAPHS)
- Exploring the Call Graph (THE MAGMA PROFILER)
- Generating Graphs (GRAPHS)
- Graph Databases and Graph Generation (GRAPHS)
- GRAPHS
- Incidence Structures, Graphs and Codes (INCIDENCE STRUCTURES AND DESIGNS)
- Planes, Graphs and Codes (FINITE PLANES)
- Removing Edges (GRAPHS)
- Removing Vertices (GRAPHS)
- Scheme Graph Maps (SCHEMES)
- Small Graphs (GRAPHS)
- Strongly Regular Graphs (GRAPHS)
- The Cayley Graph (FINITELY PRESENTED GROUPS)
- The Graph of a Map (MAPPINGS)
graph-code
- Incidence Structures, Graphs and Codes (INCIDENCE STRUCTURES AND DESIGNS)
- Planes, Graphs and Codes (FINITE PLANES)
graph-databases
- Graph Databases and Graph Generation (GRAPHS)
graph-digraph
- Construction of Graphs and Digraphs (GRAPHS)
graph-generation
- Generating Graphs (GRAPHS)
graph-maps
- Scheme Graph Maps (SCHEMES)
graph-mutation-add-e
- Adding Edges (GRAPHS)
graph-mutation-add-v
- Adding Vertices (GRAPHS)
graph-mutation-rm-e
- RemoveEdge(~G, e) : Grph, GrphEdge ->
- RemoveEdges(~G, S) : Grph, { GrphEdge } ->
- Removing Edges (GRAPHS)
graph-mutation-rm-v
- RemoveVertex(~G, v) : Grph, GrphVert ->
- RemoveVertices(~G, U) : Grph, { GrphVert } ->
- Removing Vertices (GRAPHS)
graph-small
- Small Graphs (GRAPHS)
graph-small-access
- Access functions (GRAPHS)
graph-small-creation
- Creation of Small Graph Databases (GRAPHS)
graph-stream-access
- A General Facility (GRAPHS)
graph-strongly-regular
- Strongly Regular Graphs (GRAPHS)
graph_maps
- Scheme_graph_maps (Example H119E54)
GraphAutomorphism
- GraphAutomorphism(U, p) : AlgQUE, GrpPermElt -> Map
- DiagramAutomorphism(U, p) : AlgQUE, GrpPermElt -> Map
- GraphAutomorphism(L, p) : AlgLie, GrpPermElt -> Map
- GraphAutomorphism(G, p) : GrpLie, GrpPermElt -> Map
- AlgLie_GraphAutomorphism (Example H107E47)
GraphGeneralAccess
- Graph_GraphGeneralAccess (Example H158E24)
GraphGeneration
- Graph_GraphGeneration (Example H158E23)
Graphics
- GrpPSL2_Graphics (Example H139E11)
- GrpPSL2_Graphics (Example H139E9)
graphics
- Graphical Output (CONGRUENCE SUBGROUPS OF PSL₂(R))
GraphIsomorphim
- Graph_GraphIsomorphim (Example H158E19)
Graphs
- ChangGraphs() : -> [GrpUnd, GrpUnd, GrpUnd]
- GenerateGraphs(n : parameters) : RngIntElt -> IO
- Graphs(D, S) : DB, SeqEnum -> SeqEnum
- NumberOfGraphs(D) : DB -> RngIntElt
- NumberOfGraphs(D, S) : DB, SeqEnum -> RngIntElt
- StronglyRegularGraphsDatabase() : -> DB
graphs
- Graphs with a Sparse Representation (GRAPHS)
- Resolution Graphs (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
- Design_graphs (Example H156E12)
GraphSizeInBytes
- GraphSizeInBytes(n, m : parameters): RngIntElt, RngIntElt -> RngIntElt
Gray
- GrayMap(C) : Code -> Map
- GrayMapImage(C) : Code -> [ ModTupRngElt ]
- HasLinearGrayMapImage(C) : Code -> BoolElt, Code
- PermutationGroupGrayMapImage(C) : CodeLinRng -> GrpPerm
gray
- The Gray Map (LINEAR CODES OVER THE INTEGER RESIDUE RING Z₄)
gray-map
- The Gray Map (LINEAR CODES OVER THE INTEGER RESIDUE RING Z₄)
GrayMap
- GrayMap(C) : Code -> Map
- CodeZ4_GrayMap (Example H165E1)

V2.28, 13 July 2023

Magma is maintained and distributed by the Computational Algebra Group, School of Mathematics and Statistics, University of Sydney.