Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)

From MaRDI portal
Publication:252843
Jump to:navigation, search

zbMath1331.05238MaRDI QIDQ252843

Chalermpong Worawannotai, Supalak Sumalroj

Publication date: 4 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p32


zbMATH Keywords

nonexistencedistance-regular graphpartial linear space


Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)


Related Items

On the coset graph construction of distance-regular graphs ⋮ Unnamed Item



Cites Work

  • Unnamed Item
  • Distance regular graphs of diameter 3 and strongly regular graphs
  • A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist


This page was built for publication: The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:252843&oldid=12142524"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki