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

A distance regular graph of type \(E_1\circ E_d\)

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

DOI10.1007/BF02898980zbMath1003.05108MaRDI QIDQ1590202

Hong You, Suo-gang Gao

Publication date: 3 January 2001

Published in: Chinese Science Bulletin (Search for Journal in Brave)


zbMATH Keywords

characterizationtight distance regular graphstype graph


Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)




Cites Work

  • Tight graphs and their primitive idempotents
  • Twice Q-polynomial distance-regular graphs are thin
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A distance regular graph of type \(E_1\circ E_d\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1590202&oldid=13882484"
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 02:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki