<p><a id="biBBCN_1989" name="biBBCN_1989"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>BCN89</span>] <b class='BibAuthor'>Brouwer, A. E., Cohen, A. M. and Neumaier, A.</b>,
<i class='BibTitle'>Distance-Regular Graphs</i>,
<span class='BibPublisher'>Springer-Verlag, Berlin</span>
(<span class='BibYear'>1989</span>).
</p>
<p><a id="biBBH_2011" name="biBBH_2011"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>BH11</span>] <b class='BibAuthor'>Brouwer, A. E. and Haemers, W. H.</b>,
<i class='BibTitle'>Spectra of Graphs</i>,
<span class='BibPublisher'>Springer Science \& Business Media</span>
(<span class='BibYear'>2011</span>).
</p>
<p><a id="biBC_1959" name="biBC_1959"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Cha59</span>] <b class='BibAuthor'>Chang, L.-C.</b>,
<i class='BibTitle'>The Uniqueness and Non-Uniqueness of the Triangular Association
Scheme</i>,
in <i class='BibBooktitle'>Science Record</i>,
<span class='BibPublisher'>Peking Mathematical Society</span>,
<em class='BibVolume'>3</em>
(<span class='BibYear'>1959</span>),
<span class='BibPages'>604--613</span>.
</p>
<p><a id="biBC_1958" name="biBC_1958"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Con58</span>] <b class='BibAuthor'>Connor, W. S.</b>,
<i class='BibTitle'>The Uniqueness of the Triangular Association Scheme</i>,
<span class='BibJournal'>The Annals of Mathematical Statistics</span>,
<em class='BibVolume'>29</em> (<span class='BibNumber'>1</span>)
(<span class='BibYear'>1958</span>),
<span class='BibPages'>262--266</span>.
</p>
<p><a id="biBDIGRAPHS_2019" name="biBDIGRAPHS_2019"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>DBJM+19</span>] <b class='BibAuthor'>De Beule, J., Jonu{\~s}as, J., Mitchell, J. D., Torpey, M. C. and Wilson, W. A.</b>,
<i class='BibTitle'>Digraphs -- A GAP package, Version
0.15.3</i>
(<span class='BibYear'>2019</span>)<br />
(<span class='BibNote'>Refereed GAP package, available at
\href{https://gap-packages.github.io/Digraphs/}{https://gap-packages.github.io/Digraphs/}</span>).
</p>
<p><a id="biBD_1975" name="biBD_1975"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Del73</span>] <b class='BibAuthor'>Delsarte, P.</b>,
<i class='BibTitle'>An algebraic approach to the association schemes of coding
theory</i>,
<span class='BibJournal'>Philips Research Reports. Supplements</span>,
<em class='BibVolume'>10</em>
(<span class='BibYear'>1973</span>),
<span class='BibPages'>143--161</span>.
</p>
<p><a id="biBE_2020" name="biBE_2020"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Eva20</span>] <b class='BibAuthor'>Evans, R. J.</b>,
<i class='BibTitle'>On regular induced subgraphs of edge-regular graphs</i>,
<span class='BibType'>Ph.D. thesis</span>,
<span class='BibSchool'>School of Mathematical Sciences, Queen Mary University of
London</span>
(<span class='BibYear'>2020</span>).
</p>
<p><a id="biBGS_2016" name="biBGS_2016"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>GS16</span>] <b class='BibAuthor'>Greaves, G. R. W. and Soicher, L. H.</b>,
<i class='BibTitle'>On the clique number of a strongly regular graph</i>,
<span class='BibJournal'>Electronic Journal of Combinatorics</span>,
<em class='BibVolume'>25(4)</em> (<span class='BibNumber'>P4.15</span>)
(<span class='BibYear'>2016</span>).
</p>
<p><a id="biBGAPDOC_2019" name="biBGAPDOC_2019"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>LN19</span>] <b class='BibAuthor'>L{\"u}beck, F. and Neunh{\"o}ffer, M.</b>,
<i class='BibTitle'>GAPDoc -- A GAP package, Version 1.6.1</i>
(<span class='BibYear'>2019</span>)<br />
(<span class='BibNote'>Refereed GAP package, available at
\href{http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html}{http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html}</span>).
</p>
<p><a id="biBS_1959b" name="biBS_1959b"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Shr59</span>] <b class='BibAuthor'>Shrikhande, S. S.</b>,
<i class='BibTitle'>The Uniqueness of the L_2 Association
Scheme</i>,
<span class='BibJournal'>The Annals of Mathematical Statistics</span>,
<em class='BibVolume'>230</em> (<span class='BibNumber'>3</span>)
(<span class='BibYear'>1959</span>),
<span class='BibPages'>781--798</span>.
</p>
<p><a id="biBS_2010" name="biBS_2010"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Soi10</span>] <b class='BibAuthor'>Soicher, L. H.</b>,
<i class='BibTitle'>More on block intersection polynomials and new applications to graphs
and block designs</i>,
<span class='BibJournal'>Journal of Combinatorial Theory, Series A</span>,
<em class='BibVolume'>117</em> (<span class='BibNumber'>7</span>)
(<span class='BibYear'>2010</span>),
<span class='BibPages'>799--809</span>.
</p>
<p><a id="biBS_2015" name="biBS_2015"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Soi15</span>] <b class='BibAuthor'>Soicher, L. H.</b>,
<i class='BibTitle'>On cliques in edge-regular graphs</i>,
<span class='BibJournal'>Journal of Algebra</span>,
<em class='BibVolume'>421</em>
(<span class='BibYear'>2015</span>),
<span class='BibPages'>260--267</span>.
</p>
<p><a id="biBGRAPE_2018" name="biBGRAPE_2018"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Soi18</span>] <b class='BibAuthor'>Soicher, L. H.</b>,
<i class='BibTitle'>GRAPE, GRaph Algorithms using PErmutation groups,
Version 4.8</i>
(<span class='BibYear'>2018</span>)<br />
(<span class='BibNote'>Refereed GAP package, available at
\href{https://gap-packages.github.io/grape/}{https://gap-packages.github.io/grape/}</span>).
</p>
<p><a id="biBDESIGN_2019" name="biBDESIGN_2019"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Soi19</span>] <b class='BibAuthor'>Soicher, L. H.</b>,
<i class='BibTitle'>The DESIGN package for GAP, Version 1.7</i>
(<span class='BibYear'>2019</span>)<br />
(<span class='BibNote'>Refereed GAP package, available at
\href{https://gap-packages.github.io/design/}{https://gap-packages.github.io/design/}</span>).
</p>
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.