[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: graph .. Greatest
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 Graph of a Map (MAPPINGS)
Incidence Structures, Graphs and Codes (INCIDENCE STRUCTURES AND DESIGNS)
Planes, Graphs and Codes (FINITE PLANES)
Graph Databases and Graph Generation (GRAPHS)
Construction of Graphs and Digraphs (GRAPHS)
Generating Graphs (GRAPHS)
Scheme Graph Maps (SCHEMES)
Adding Edges (GRAPHS)
Adding Vertices (GRAPHS)
RemoveEdge(~G, e) : Grph, GrphEdge ->
RemoveEdges(~G, S) : Grph, { GrphEdge } ->
Removing Edges (GRAPHS)
RemoveVertex(~G, v) : Grph, GrphVert ->
RemoveVertices(~G, U) : Grph, { GrphVert } ->
Removing Vertices (GRAPHS)
Small Graphs (GRAPHS)
Access functions (GRAPHS)
Creation of Small Graph Databases (GRAPHS)
A General Facility (GRAPHS)
Strongly Regular Graphs (GRAPHS)
Scheme_graph_maps (Example H112E48)
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 H100E47)
Graph_GraphGeneralAccess (Example H149E24)
Graph_GraphGeneration (Example H149E23)
GrpPSL2_Graphics (Example H130E11)
GrpPSL2_Graphics (Example H130E9)
Graphical Output (CONGRUENCE SUBGROUPS OF PSL2(R))
Graph_GraphIsomorphim (Example H149E19)
ChangGraphs() : -> [GrpUnd, GrpUnd, GrpUnd]
GenerateGraphs(n : parameters) : RngIntElt -> File
Graphs(D, S) : DB, SeqEnum -> SeqEnum
NumberOfGraphs(D) : DB -> RngIntElt
NumberOfGraphs(D, S) : DB, SeqEnum -> RngIntElt
StronglyRegularGraphsDatabase() : -> DB
Graphs with a Sparse Representation (GRAPHS)
Resolution Graphs (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Design_graphs (Example H147E12)
GraphSizeInBytes(n, m : parameters): RngIntElt, RngIntElt -> RngIntElt
GrayMap(C) : Code -> Map
GrayMapImage(C) : Code -> [ ModTupRngElt ]
HasLinearGrayMapImage(C) : Code -> BoolElt, Code
GrayMap(C) : Code -> Map
CodeRng_GrayMap (Example H155E7)
GrayMapImage(C) : Code -> [ ModTupRngElt ]
HILBERT SERIES OF POLARISED VARIETIES
HILBERT SERIES OF POLARISED VARIETIES
Xgcd(m, n) : RngIntElt, RngIntElt -> RngIntElt, RngIntElt, RngIntElt
XGCD(m, n) : RngIntElt, RngIntElt -> RngIntElt, RngIntElt, RngIntElt
ExtendedGreatestCommonDivisor(m, n) : RngIntElt, RngIntElt -> RngIntElt, RngIntElt, RngIntElt
ExtendedGreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt, RngUPolElt, RngUPolElt
ExtendedGreatestCommonDivisor(v, w) : RngValElt, RngValElt -> RngValElt, RngValElt, RngValElt
ExtendedGreatestCommonDivisor(s) : [RngIntElt] -> RngIntElt, [RngIntElt]
ExtendedGreatestCommonLeftDivisor(A, B) : RngDiffOpElt, RngDiffOpElt -> RngDiffOpElt, RngDiffOpElt, RngDiffOpElt
ExtendedGreatestCommonRightDivisor(A, B) : RngDiffOpElt, RngDiffOpElt -> RngDiffOpElt, RngDiffOpElt, RngDiffOpElt
GCD(D1, D2) : DivCrvElt, DivCrvElt -> DivCrvElt
GCD(D1, D2) : DivFunElt, DivFunElt -> DivFunElt
GCD(I, J) : RngOrdFracIdl, RngOrdFracIdl -> RngOrdFracIdl
Gcd(a, b) : RngQuadElt, RngQuadElt -> RngQuadElt
GreatestCommonDivisor(a, b) : RngIntResElt, RngIntResElt -> RngIntResElt
GreatestCommonDivisor(f, g) : RngMPolElt, RngMPolElt -> RngMPolElt
GreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt
GreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt
GreatestCommonDivisor(v, w) : RngValElt, RngValElt -> RngValElt
GreatestCommonDivisor(s) : [RngIntElt] -> RngIntElt
GreatestCommonLeftDivisor(A, B) : RngDiffOpElt, RngDiffOpElt -> RngDiffOpElt
GreatestCommonRightDivisor(A, B) : RngDiffOpElt, RngDiffOpElt -> RngDiffOpElt
LeftGCD(u, v: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
LeftGCD(S: parameters) : Setq -> GrpBrdElt
RightGCD(u, v: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
RightGCD(S: parameters) : Setq -> GrpBrdElt
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Wed Apr 24 15:09:57 EST 2013