Quelle srglib.xml Sprache: XML

<Chapter Label="srglib">
<Heading>Strongly regular graphs</Heading>

In this chapter we give functions to investigate strongly regular graphs. In
particular, we provide a collection of strongly regular graphs which can
be a useful computational resource.

<Section Label="Strongly regular graph parameter tuples">
<Heading>Strongly regular graph parameter tuples</Heading>

In this section, we give functions to investigate the parameters of a strongly
regular graph. For the definition of feasible strongly regular graph parameters, see
<Ref Func="IsFeasibleSRGParameters"/>.

<#Include Label="ComplementSRGParameters">

<#Include Label="SRGToGlobalParameters">

<#Include Label="GlobalToSRGParameters">

<#Include Label="IsPrimitiveSRGParameters">

<#Include Label="IsTypeISRGParameters">

<#Include Label="IsTypeIISRGParameters">

<#Include Label="KreinParameters">

<#Include Label="IsKreinConditionsSatisfied">

<#Include Label="IsAbsoluteBoundSatisfied">

</Section>

<Section Label="Small strongly regular graphs">
<Heading>Small strongly regular graphs</Heading>

In this section, we give functions to access and use the library of strongly
regular graphs currently stored in this package. The information on small
strongly regular graphs in this section is based on the tables of Andries
Brouwer <Cite Key="B_2018"/>.

<#Include Label="AGT_Brouwer_Parameters_MAX">

<#Include Label="AGT_Brouwer_Parameters">

<#Include Label="IsSRGAvailable">

<#Include Label="SRGLibraryInfo">

<#Include Label="SRG">

<#Include Label="NrSRGs">

<#Include Label="OneSRG">

<#Include Label="AllSRGs">

<#Include Label="SRGIterator">

<#Include Label="SmallFeasibleSRGParameterTuples">

<#Include Label="IsEnumeratedSRGParameterTuple">

<#Include Label="IsKnownSRGParameterTuple">

<#Include Label="IsAllSRGsStored">
</Section>
<Section Label="More strongly regular graphs">
<Heading>Strongly regular graph constructors</Heading>

In this section, we give functions to construct certain graphs, most of which
are strongly regular graphs.

<#Include Label="DisjointUnionOfCliques">

<#Include Label="CompleteMultipartiteGraph">

<#Include Label="TriangularGraph">

<#Include Label="SquareLatticeGraph">

<#Include Label="HoffmanSingletonGraph">

<#Include Label="HigmanSimsGraph">

<#Include Label="SimsGerwitzGraph">

</Section>

</Chapter>

quality99%

¤ Dauer der Verarbeitung: 0.11 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.