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

Delsarte set graphs with small \(c_{2}\)

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

DOI10.1007/s00373-010-0905-1zbMath1221.05103OpenAlexW2129891706MaRDI QIDQ604668

Jack H. Koolen, Akira Hiraki, Sejeong Bang

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0905-1


zbMATH Keywords

distance-regular graphJohnson graphDelsarte cliqueDelsarte set graph


Mathematics Subject Classification ID

Distance in graphs (05C12)


Related Items

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ On bounding the diameter of a distance-regular graph ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ Geometric distance-regular graphs without 4-claws ⋮ Completely regular clique graphs ⋮ Distance-regular graphs with or at least half the valency ⋮ Coverings and homotopy of a graph ⋮ Completely regular clique graphs. II



Cites Work

  • Delsarte clique graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:604668&oldid=12495125"
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 08:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki