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

Twice Q-polynomial distance-regular graphs

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

DOI10.1006/jctb.1996.0061zbMath0860.05072OpenAlexW2064545263MaRDI QIDQ1924162

Garth A. Dickie

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0061


zbMATH Keywords

distance-regular graphsstrongly regularQ-polynomialkite numbers


Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)


Related Items

Twice Q-polynomial distance-regular graphs are thin ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs



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