Delsarte clique graphs (Q866506)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Delsarte clique graphs	scientific article

Statements

scholarly article

0 references

Delsarte clique graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejc.2005.04.015

0 references

0 references

0 references

0 references

European Journal of Combinatorics

0 references

publication date

14 February 2007

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

distance-regular graphs

0 references

Hamming graphs

0 references

Johnson graphs

0 references

Grassmann graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2005.04.015

0 references

0 references

0 references

A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs

0 references

A new distance-regular graph associated to the Mathieu group \(M_{10}\)

0 references

A new family of distance-regular graphs with unbounded diameter

0 references

Problems in algebraic combinatorics

0 references

A Higman-Haemers inequality for thick regular near polygons

0 references

The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)

0 references

Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:866506

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q866506&oldid=34920754"