Subindex: <B><B>graph</B> .. Greatest</B>

[____] [____] [_____] [____] [__] [Index] [Root]

Subindex: graph .. Greatest

graph

   A General Facility (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)
   Combinatorial and Geometrical Structures (OVERVIEW)
   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)
   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 Database 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)
   Strongly Regular Graphs (GRAPHS)
   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 Database and Graph Generation (GRAPHS)

graph-digraph

Construction of Graphs and Digraphs (GRAPHS)

graph-generation

Generating Graphs (GRAPHS)

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-stream-access

A General Facility (GRAPHS)

graph-strongly-regular

Strongly Regular Graphs (GRAPHS)

GraphAutomorphism

GraphAutomorphism(L, p) : AlgLie, GrpPermElt -> Map
GraphAutomorphism(G, p) : GrpLie, GrpPermElt -> Map

GraphGeneralAccess

Graph_GraphGeneralAccess (Example H117E24)

GraphGeneration

Graph_GraphGeneration (Example H117E23)

Graphics

GrpPSL2_Graphics (Example H37E11)
GrpPSL2_Graphics (Example H37E9)

graphics

Graphical Output (SUBGROUPS OF PSL_2(R))

GraphIsomorphim

Graph_GraphIsomorphim (Example H117E19)

Graphs

   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

   Graphs with a Sparse Representation (GRAPHS)
   Resolution Graphs (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
   Design_graphs (Example H120E12)

GraphSizeInBytes

GraphSizeInBytes(n, m : parameters): RngIntElt, RngIntElt -> RngIntElt

Gray

   GrayMap(C) : Code -> Map
   GrayMapImage(C) : Code -> [ ModTupRngElt ]
   HasLinearGrayMapImage(C) : Code -> BoolElt, Code

GrayMap

GrayMap(C) : Code -> Map
CodeRng_GrayMap (Example H127E7)

GrayMapImage

GrayMapImage(C) : Code -> [ ModTupRngElt ]

grd

HILBERT SERIES OF POLARISED VARIETIES

grd-rng

HILBERT SERIES OF POLARISED VARIETIES

greater

Comparison (OVERVIEW)

Greatest

   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
   GreatestCommonDivisor(Q) : [RngIntResElt] -> RngIntResElt
   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]