Revision as of 06:47, 8 September 2019 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,850 edits →Further reading: \|ref=harv ← Previous edit		Revision as of 10:48, 11 September 2019 edit undo Monkbot (talk \| contribs) Bots 3,695,952 edits m →Strongly regular graphs: Task 16: replaced (1×) / removed (0×) deprecated \|dead-url= and \|deadurl= with \|url-status=; Tag: AWB Next edit →
Line 29: A graph of this kind is sometimes said to be an srg(''v'', ''k'', λ, μ). Some authors exclude graphs which satisfy the definition trivially, namely those graphs which are the disjoint union of one or more equal-sized [[complete graph]]s,<ref>{{Cite web \|url=http://homepages.cwi.nl/~aeb/math/ipm.pdf \|title=Brouwer, Andries E; Haemers, Willem H. ''Spectra of Graphs''. p. 101 \|access-date=2014-10-10 \|archive-url=https://web.archive.org/web/20120316102909/http://homepages.cwi.nl/~aeb/math/ipm.pdf \|archive-date=2012-03-16 \|~~dead~~url-~~url=yes \|df~~status=dead }}</ref><ref>Godsil, Chris; Royle, Gordon. ''Algebraic Graph Theory''. Springer-Verlag New York, 2001, p. 218.</ref> and their [[complement graph\|complements]], the [[Turán graph]]s. ===Young tableaux===

Algebraic combinatorics: Difference between revisions