Book ChapterDOI
Distance-Regular Graphs
Akihito Hora,Nobuaki Obata +1 more
- pp 85-103
About:
The article was published on 2007-01-01. It has received 1089 citations till now. The article focuses on the topics: Intersection number (graph theory) & Adjacency matrix.read more
Citations
More filters
BookDOI
Spectra of graphs
TL;DR: This book gives an elementary treatment of the basic material about graph Spectra, both for ordinary, and Laplace and Seidel spectra, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics.
Posted Content
Coding for Errors and Erasures in Random Network Coding
TL;DR: A Reed-Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style ldquolist-1rdquo minimum-distance decoding algorithm is provided.
Book ChapterDOI
Pseudo-random Graphs
TL;DR: Pseudo-random graphs are introduced, a concept of deterministically graphs that look random-like that serves as a natural motivation for the following very general and deep informal questions: what are the essential properties of random graphs?
Journal ArticleDOI
Dynamic Cage Survey
Geoffrey Exoo,Robert Jajcay +1 more
TL;DR: In this paper, the results of over 50 years of searches for cages are presented, along with the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions.
Journal ArticleDOI
A survey on spherical designs and algebraic combinatorics on spheres
Eiichi Bannai,Etsuko Bannai +1 more
TL;DR: These theories of spherical t-designs and related topics have strong roots in the developments of algebraic combinatorics in general, which was started as Delsarte theory of codes and designs in the framework of association schemes.
References
More filters
Book
Algebraic Graph Theory
Chris Godsil,Gordon F. Royle +1 more
TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
BookDOI
Spectra of graphs
TL;DR: This book gives an elementary treatment of the basic material about graph Spectra, both for ordinary, and Laplace and Seidel spectra, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics.
Posted Content
Coding for Errors and Erasures in Random Network Coding
TL;DR: A Reed-Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style ldquolist-1rdquo minimum-distance decoding algorithm is provided.
Book ChapterDOI
Pseudo-random Graphs
TL;DR: Pseudo-random graphs are introduced, a concept of deterministically graphs that look random-like that serves as a natural motivation for the following very general and deep informal questions: what are the essential properties of random graphs?
Journal ArticleDOI
Base size, metric dimension and other invariants of groups and graphs
TL;DR: The base size of a permutation group and the metric dimension of a graph are two of the related parameters of groups, graphs, coherent configurations and association schemes as mentioned in this paper, and they have been repeatedly re-defined with different terminology in various different areas, including computational group theory and the graph isomorphism problem.