Index

AddEdges B.1-1
AddVerticesByAdjacencies B.1-2
Adjacencies B.1-3
Adjacency B.1-4
adjacency list B.1-4
adjacency lists B.1-3
adjacency matrix B.1-5
AdjMatrix B.1-5
AGraph B.1-6
AntennaGraph B.1-7
arrows 4.
AutGroupGraph B.1-8
AutomorphismGroup B.1-8
automorphisms, group of B.1-8
Backtrack B.2-1
BacktrackBag B.2-2
basement 3.3 B.2-3
Basement B.2-3 B.2-3
BiMorphism 5.2
BiMorphisms 5.2
BoundaryVertices B.2-4
box product B.2-5
BoxProduct B.2-5
boxtimes product B.2-6
BoxTimesProduct B.2-6
Bron-Kerbosch algorithm 3.1 B.3-7
BullGraph B.2-7
CayleyGraph B.3-1 B.3-1
ChairGraph B.3-2
CHK_CMPLT 5.3
CHK_EPI 5.3
CHK_METRIC 5.3
CHK_MONO 5.3
CHK_MORPH 5.3
CHK_WEAK 5.3
Circulant B.3-3
circulant, random B.18-2
ClawGraph B.3-4
clique 3. B.3-7
clique behavior 3.5
clique convergent 3.5
clique divergent 3.5
clique graph 3. B.3-5
clique number 3.1 B.3-6
clique of cliques 3.4
clique-Helly 3.4 B.9-11
    Dragan-Szwarcfiter characterization B.9-11
CliqueGraph B.3-5 B.3-5
CliqueNumber B.3-6
Cliques B.3-7 B.3-7
, number of 3.1
ClockworkGraph B.3-8 B.3-8 B.3-8 B.3-8
coloring 6.1
, proper 6.2
ComplementGraph B.3-9
CompleteBipartiteGraph B.3-10
CompleteEpiMorphism 5.2
CompleteEpiMorphisms 5.2
CompleteEpiWeakMorphism 5.2
CompleteEpiWeakMorphisms 5.2
CompleteGraph B.3-11
CompletelyParedGraph B.3-12
CompleteMorphism 5.2
CompleteMorphisms 5.2
CompleteMultipartiteGraph B.3-13
CompletesOfGivenOrder B.3-14
CompleteWeakMorphism 5.2
CompleteWeakMorphisms 5.2
Composition B.3-15
Cone B.3-16
ConnectedComponents B.3-17
ConnectedGraphsOfGivenOrder B.3-18
Coordinates B.3-19
CopyCoordinates B.3-20 B.3-20
CopyGraph B.3-21
Cube B.3-22
CubeGraph B.3-23
CycleGraph B.3-24
CylinderGraph B.3-25
DartGraph B.4-1
DeclareQtfyProperty B.4-2
DefaultGraphCategory 4.1
degree, of a vertex B.22-1
derangements B.2-1 B.2-2
DFSTree B.4-3 B.4-3
Diameter B.4-4
DiamondGraph B.4-5
digraphs 4.1
DiscreteGraph B.4-6
DisjointUnion B.4-7
Distance B.4-8
DistanceGraph B.4-10
DistanceMatrix B.4-11
Distances B.4-9
DistanceSet B.4-12
Dodecahedron B.4-13
dominated vertices 3.4 B.3-12 B.16-4
DominatedVertices B.4-14
DominoGraph B.4-15
Draw B.4-16 B.4-16
DumpObject B.4-17
EasyExec B.5-1 B.5-1
Eccentricity B.5-2
edges 4.
Edges B.5-3
EmptyGraph B.5-4
EpiMetricMorphism 5.2
EpiMetricMorphisms 5.2
EpiMorphism 5.2
EpiMorphisms 5.2
EpiWeakMorphism 5.2
EpiWeakMorphisms 5.2
EquivalenceRepresentatives B.5-5
ExportGraph6 B.5-6 B.5-6
FanGraph B.6-1
FishGraph B.6-2
forest, spanning B.19-6 B.19-7
FullBiMorphism 5.2
FullBiMorphisms 5.2
FullEpiMorphism 5.2
FullEpiMorphisms 5.2
FullEpiWeakMorphism 5.2
FullEpiWeakMorphisms 5.2
FullMonoMorphism 5.1 5.2
FullMonoMorphisms 5.1 5.2
FullMorphism 5.2
FullMorphisms 5.2
FullWeakMorphism 5.2
FullWeakMorphisms 5.2
GAP's installation directory 2.2
GAP-DIR 2.2
GemGraph B.7-1
Girth B.7-2
Graph B.7-3
graph, A B.1-6
    antenna B.1-7
    automorphism group of a B.1-8
    bull B.2-7
    Cayley's B.3-1
    chair B.3-2
    claw B.3-4
    clique B.3-5
    clockwork B.3-8
    complement B.3-9
    complete B.3-11
    complete bipartite B.3-10
    complete multipartite B.3-13
    completely pared B.3-12
    convert from graph6 format B.7-5
    convert to graph6 format B.7-16
    copying B.3-21
    cube B.3-23
    cycle B.3-24
    cylinder B.3-25
    dart B.4-1
    diamond B.4-5
    discrete B.4-6
    distance B.4-10
    domino B.4-15
    empty B.5-4
    exporting from graph6 format B.5-6
    fan B.6-1
    fish B.6-2
    gem B.7-1
    group B.7-19
    house B.8-2
    importing from graph6 format B.9-2
    intersection B.9-8
    Johnson B.10-1
    kite B.11-1
    line B.12-1
    locally constant B.9-19
    locally H B.9-20
    octahedral B.15-1
    parachute B.16-2
    parapluie B.16-3
    pared B.16-4
    path B.16-5
    paw B.16-6
    Petersen's B.16-7
    power B.16-8
    QuadraticRing B.17-2
    quotient B.17-3
    R B.18-9
    random B.18-3
    ring B.18-10
    spiky B.19-8
    sun B.19-9
    torus B.20-5
    tree B.20-6
    trivial B.20-7
    UnitsRing B.21-4
    wheel B.23-1
graph categories 4.
graph morphisms 5.1
Graph6ToGraph B.7-5
GraphAttributeStatistics B.7-4
GraphByAdjacencies B.7-6
GraphByAdjMatrix B.7-7
GraphByCompleteCover B.7-8
GraphByEdges B.7-9
GraphByRelation B.7-10 B.7-10
GraphByWalks B.7-11
GraphCategory B.7-12
Graphs 4.
Graphs B.7-13
graphs B.7-13
    isomorphic B.9-17
    loopless B.12-4
    oriented B.15-5
    simple B.19-3
    undirected B.21-3
GraphsOfGivenOrder B.7-14
GraphSum B.7-15
GraphToGraph6 B.7-16
GraphToRaw B.7-17 B.7-17
GraphUpdateFromRaw B.7-18
GroupGraph B.7-19 B.7-19
HararyToMcKay B.8-1
Helly property B.9-11
homomorphisms 5.1
HouseGraph B.8-2
hypercube B.3-23
Icosahedron B.9-1
immutable graphs 3.1
ImportGraph6 B.9-2
ImportGraph6Iterator B.9-3
in B.9-4
InducedSubgraph B.9-5
InfoClass B.24-3
InfoLevel B.24-3
InNeigh B.9-6
InteriorVertices B.9-7
IntersectionGraph B.9-8
Is2Regular B.4-2
IsBoolean B.9-9
IsCliqueGated B.9-10
IsCliqueHelly B.9-11
IsCompactSurface B.9-12
IsComplete B.9-13
IsCompleteGraph B.9-14
IsDiamondFree B.9-15
IsEdge B.9-16 B.9-16
IsInducedSubgraph 5.1
IsIsomorphicGraph B.9-17
IsKColorable 5.1
IsListOfPositiveIntegers B.9-18
IsLocallyConstant B.9-19
IsLocallyH B.9-20
IsLoopless B.9-21
isomorphism 5.2
IsoMorphism B.9-22
IsoMorphisms B.9-23
IsOriented B.9-24
IsSimple B.9-25
IsSurface B.9-26
IsTournament B.9-27
IsTransitiveTournament B.9-28
IsUndirected B.9-29
Iterated clique graphs 3.3
Johnson graph B.10-1
JohnsonGraph B.10-1
Join B.10-2
K(G) B.3-5
KiteGraph B.11-1
LineGraph B.12-1
Link B.12-2
Links B.12-3
locally constant B.9-19
locally H B.9-20
LooplessGraphs 4.
LooplessGraphs B.12-4
loops 4.
MaxDegree B.13-1
McKayToHarary B.8-1
MetricMorphism 5.2
MetricMorphisms 5.2
MinDegree B.13-2
modifying graphs 2.3
MonoMorphism 5.2
MonoMorphisms 5.2
Morphism 5.1 5.2
Morphisms 5.1
morphisms 5.1
Morphisms 5.2
morphisms of graphs 5.1
mutable graphs 3.1
necktie 3.4
next morphism 5.1
NextBiMorphism 5.2
NextCompleteEpiMorphism 5.2
NextCompleteEpiWeakMorphism 5.2
NextCompleteMorphism 5.2
NextCompleteWeakMorphism 5.2
NextEpiMetricMorphism 5.2
NextEpiMorphism 5.2
NextEpiWeakMorphism 5.2
NextFullBiMorphism 5.2
NextFullEpiMorphism 5.2
NextFullEpiWeakMorphism 5.2
NextFullMonoMorphism 5.1 5.2
NextFullMorphism 5.2
NextFullWeakMorphism 5.2
NextIsoMorphism B.14-1
NextMetricMorphism 5.2
NextMonoMorphism 5.2
NextMorphism 5.1 5.2
NextPropertyMorphism B.14-2
NextWeakMorphism 5.2
number of cliques 3.1
NumberOfCliques B.14-3 B.14-3
NumberOfConnectedComponents B.14-4
OctahedralGraph B.15-1
Octahedron B.15-2
ω(G) 3.1 B.3-6
options stack 4.3
Order B.15-3
Orientations B.15-4
OrientedGraphs 4.
OrientedGraphs B.15-5
OutNeigh B.15-6
Paley tournament B.16-1
PaleyTournament B.16-1
ParachuteGraph B.16-2
ParapluieGraph B.16-3
ParedGraph B.16-4
partial morphism 5.1
PathGraph B.16-5
PawGraph B.16-6
PetersenGraph B.16-7
PowerGraph B.16-8
predefined property-checking functions 5.3
product of graphs, box B.2-5
    boxtimes B.2-6
    Cartesian B.2-5
    strong B.2-6
    tensor B.20-4
    times B.20-4
progress reporting B.24-3
proper coloring 6.2
property-checking functions 5.3
    predefined 5.3
    user-defined 5.4
PropertyMorphism B.16-9
PropertyMorphisms B.16-10
QtfyIsSimple B.17-1
QuadraticRingGraph B.17-2
QuotientGraph B.17-3 B.17-3
Radius B.18-1
RandomCirculant B.18-2 B.18-2 B.18-2
RandomGraph B.18-3 B.18-3
RandomlyPermuted B.18-6
RandomPermutation B.18-4
RandomSubset B.18-5 B.18-5 B.18-5
reachable vertices B.3-17
RemoveEdges B.18-7
RemoveVertices B.18-8
RGraph B.18-9
RingGraph B.18-10
searching in combinatorial spaces 6.
SetCoordinates B.19-1
SetDefaultGraphCategory 4.1
SetDefaultGraphCategory B.19-2
SimpleGraphs 4. 4.
SimpleGraphs B.19-3
Size B.19-4
SnubDisphenoid B.19-5
SpanningForest B.19-6
SpanningForestEdges B.19-7
SpikyGraph B.19-8
star 3.4
, of a vertex 3.4
star morphism 3.4
strong product 4.2
subgraph, induced B.9-5
SunGraph B.19-9
Suspension B.19-10
TargetGraphCategory B.20-1
Tetrahedron B.20-2
TimeInSeconds B.20-3
times product B.20-4
TimesProduct B.20-4
TorusGraph B.20-5
tournament B.9-27
    Paley B.16-1
    transitive B.9-28
transitive tournament B.9-28
tree B.20-6
    spanning B.19-6 B.19-7
TreeGraph B.20-6 B.20-6
triangulation, Whitney B.9-12 B.9-26 B.20-5
TrivialGraph B.20-7
UFFind B.21-1
UFUnite B.21-2
UndirectedGraphs 4.
UndirectedGraphs B.21-3
union-find structure B.21-1 B.21-2
UnitsRingGraph B.21-4
user-defined property-checking functions 5.4
VertexDegree B.22-1
VertexDegrees B.22-2
VertexNames B.22-3
Vertices B.22-4
vertices, dominated B.4-14
    twin B.4-14
WeakMorphism 5.2
WeakMorphisms 5.2
WheelGraph B.23-1 B.23-1
Whitney triangulation B.9-12 B.9-26 B.20-5
working directory 2.3
WORKING-DIR 2.3
YAGSExec B.24-1
YAGSInfo B.24-2
YAGSInfo.InfoClass B.24-3
YAGSInfo.InfoOutput B.24-4
YAGSInfoClass B.24-3
YAGSPositionsTrueBlist B.24-5
Yttrium Aluminium GarnetS 1.1 2.1
Zykov sum B.10-2