Quelle references.bib Sprache: Latech

@Misc{ B_2018,
title = "{Database of strongly regular graphs}",
note = {\href{https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html}{https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html}},
author = "Brouwer, Andries E.",
        year= "2018"
}

@Misc{ B_2018b,
title = "{Graph descriptions}",
note = {\href{https://www.win.tue.nl/~aeb/graphs/index.html}{https://www.win.tue.nl/~aeb/graphs/index.html}},
year = "2018",
author = "Brouwer, Andries E."
}

@Misc{ DESIGN_2019,
  author =           {Soicher, L. H.},
  title =            {The {DESIGN} package for {GAP}, {V}ersion 1.7},
  year =             {2019},
  note =             {Refereed GAP package, available at \href{https://gap-packages.github.io/design/}{https://gap-packages.github.io/design/}}
}

@Misc{ DIGRAPHS_2019,
  author = {De Beule, J. and Jonu{\~s}as, J. and Mitchell, J. D. and Torpey, M. C.
            and Wilson, W. A.},
  title = {{Digraphs} -- A {GAP} package, {V}ersion 0.15.3},
  year = {2019},
  note =             {Refereed GAP package, available at \href{https://gap-packages.github.io/Digraphs/}{https://gap-packages.github.io/Digraphs/}}
}

@Misc{ GAPDOC_2019,
  author =           {L{\"u}beck, F. and Neunh{\"o}ffer, M.},
  title =            {{GAPDoc} -- A {GAP} package, {V}ersion 1.6.1},
  year =             {2019},
  note =             {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}}
}

@Misc{ GRAPE_2018,
  author =           {Soicher, L. H.},
  title =            {{GRAPE},  GRaph  Algorithms  using PErmutation groups,
                      {V}ersion 4.8},
  year =             {2018},
  note =             {Refereed GAP package, available at \href{https://gap-packages.github.io/grape/}{https://gap-packages.github.io/grape/}}
}

@PhDThesis{ E_2020,
  title="{On regular induced subgraphs of edge-regular graphs}",
author = "Evans, Rhys J.",
school = "School of Mathematical Sciences, Queen Mary University of London",
year = "2020"
}

@Book{ BCN_1989,
title = "{Distance-Regular Graphs}",
publisher = "Springer-Verlag, Berlin",
author = "Brouwer, Andries E. and Cohen, Arjeh M. and Neumaier, Arnold",
year = "1989"
}

@Book{ BH_2011,
title = "{Spectra of Graphs}",
isbn = "978-1-4614-1939-6",
publisher = "Springer Science \& Business Media",
author = "Brouwer, Andries E. and Haemers, Willem H.",
year = "2011"
}

@InCollection{ C_1959,
title = "{The Uniqueness and Non-Uniqueness of the Triangular Association Scheme}",
volume = "3",
booktitle = "Science Record",
publisher = "Peking Mathematical Society",
author = "Chang, Li-Chien",
year = "1959",
pages = "604--613"
}

@Article{ C_1958,
title = "{The Uniqueness of the Triangular Association Scheme}",
volume = "29",
issn = "0003-4851",
number = "1",
journal = "The Annals of Mathematical Statistics",
author = "Connor, William S.",
year = "1958",
pages = "262--266"
}

@Article{ CS_2007,
title = "{Block intersection polynomials}",
author = "Cameron, Peter J. and Soicher, Leonard H.",
year = "2007",
month = "05",
volume = "39",
journal = "Bulletin of the London Mathematical Society",
doi = "10.1112/blms/bdm034",
pages = ""
}

@Article{ D_1975,
title = "{An algebraic approach to the association schemes of coding theory}",
author = "Delsarte, Phillipe",
journal = "Philips Research Reports. Supplements",
volume = "10",
year = "1973",
pages = "143--161"
}

@Misc{ GAP_2017,
title = "{{GAP} -- {Groups}, {Algorithms}, and {Programming}}",
url = {https://www.gap-system.org},
author = "{{The GAP Group}}",
year = "2017",
note = "Version 4.8.8"
}

@Book{ G_1993,
title = "{Algebraic Combinatorics}",
isbn = "978-0-412-04131-0",
language = "en",
publisher = "CRC Press",
author = "Godsil, Chris",
month = apr,
year = "1993"
}

@Book{ GR_2001,
title = "{Algebraic Graph Theory}",
publisher = "Springer-Verlag, New York",
author = "Godsil, Chris and Royle, Gordon",
year = "2001"
}

@book{ GR_2001,
author = "Godsil, Chris and Royle, Gordon",
publisher = "Springer",
series = "Graduate Texts in Mathematics",
title = "{Algebraic Graph Theory}",
volume = "207",
year = "2001"
}

@Article{ GK_2018a,
title = "{Edge-regular graphs with regular cliques}",
author = "Greaves, Gary R. W. and Koolen, Jack H.",
    journal = "European Journal of Combinatorics",
    volume =  "71",
    pages = "194--201",
    year = "2018"
}

@Article{ GK_2018b,
title = "{Another construction of edge-regular graphs with regular cliques}",
author = "Greaves, Gary R. W. and Koolen, Jack H.",
journal = "Discrete Mathematics",
volume = "",
number = "",
year = "2018",
pages = "",
url = "https://doi.org/10.1016/j.disc.2018.09.032"
}

@Article{ GS_2016,
title = "{On the clique number of a strongly regular graph}",
journal = "Electronic Journal of Combinatorics",
volume = "25(4)",
number = "P4.15",
author = "Greaves, Gary R. W. and Soicher, Leonard H.",
year = "2016"
}

@PhDThesis{ H_1979,
title = "{Eigenvalue techniques in design and graph theory}",
author = "Haemers, Willem H.",
school = "Technische Universiteit Eindhoven",
year = "1979"
}

@Article{ H_1960,
title = "{On the Uniqueness of the Triangular Association Scheme}",
volume = "31",
issn = "0003-4851, 2168-8990",
doi = "10.1214/aoms/1177705914",
number = "2",
journal = "The Annals of Mathematical Statistics",
author = "Hoffman, Alan J.",
month = jun,
year = "1960",
mrnumber = "MR117166",
zmnumber = "0091.31504",
pages = "492--497"
}

@Article{ HR_2018,
title = "{A Census of Small Transitive Groups and Vertex-Transitive Graphs}",
author = "Holt, Derek and Royle, Gordon",
journal = "",
volume = "",
number = "",
year = "2018",
pages = "",
url = "",
note = "arXiv:1811.09015 [math.CO]"
}

@InProceedings{ N_1981,
series = "London Mathematical Society Lecture Note Series",
title = "{Regular cliques in graphs and special 1$\frac{1}{2}$ designs}",
booktitle = "Finite Geometries and Designs: Proceedings of the Second Isle of Thorns Conference 1980",
publisher = "Cambridge University Press",
author = "Neumaier, Arnold",
editor = "Cameron, Peter J. and Hirschfeld, James W. P. and Hughes, Daniel R.",
year = "1981",
pages = "244--259"
}

@InProceedings{ N_1982,
author="Neumaier, Arnold",
title="{Regular sets and quasi-symmetric $2$-designs}",
editor="Jungnickel, Dieter
and Vedder, Klaus",
booktitle="Combinatorial Theory",
year="1982",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="258--275",
isbn="978-3-540-39380-1"
}

@Article{ S_1959a,
title = "{On a Characterization of the Triangular Association Scheme}",
volume = "30",
issn = "0003-4851, 2168-8990",
doi = "10.1214/aoms/1177706357",
language = "EN",
number = "1",
journal = "The Annals of Mathematical Statistics",
author = "Shrikhande, Shartchandra S.",
month = mar,
year = "1959",
mrnumber = "MR102887",
zmnumber = "0089.15101",
pages = "39--47"
}

@Article{ S_1959b,
title = "{The Uniqueness of the ${L}_{2}$ Association Scheme}",
volume = "230",
issn = "0003-4851",
number = "3",
journal = "The Annals of Mathematical Statistics",
author = "Shrikhande, Shartchandra S.",
year = "1959",
pages = "781--798"
}

@Article{ S_2015,
title = "{On cliques in edge-regular graphs}",
volume = "421",
journal = "Journal of Algebra",
author = "Soicher, Leonard H.",
year = "2015",
pages = "260--267"
}

@Article{ S_2010,
title = "More on block intersection polynomials and new applications to graphs and block designs",
volume = "117",
number = "7",
journal = "Journal of Combinatorial Theory, Series A",
author = "Soicher, Leonard H.",
year = "2010",
pages = "799--809"
}

quality94%

¤ Dauer der Verarbeitung: 0.15 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.