Open AccessBook
Distance-Regular Graphs
Reads0
Chats0
TLDR
In this paper, a connected simple graph with vertex set X of diameter d is considered, and the authors define Ri X2 by (x, y) Ri whenever x and y have graph distance.Abstract:
Consider a connected simple graph with vertex set X of diameter d. Define Ri X2 by (x, y) Ri whenever x and y have graph distanceread more
Citations
More filters
Journal ArticleDOI
On /spl Zopf//sub 4/-linear Preparata-like and Kerdock-like codes
TL;DR: This paper proves that any additive extended Preparata (1968) -like code always verifies /spl alpha/ = 0, i.e., it is always a /spl Zopf//sub 4/-linear code.
On Sphere-Regular Graphs and the Extremality of Information-Theoretic Network Measures
TL;DR: This paper studies extremality properties of graph entropies based on so-called information functionals using metrical properties of graphs and proposes a novel class of graphs which maximizes the structural information content based on the functional using i-spheres.
Journal ArticleDOI
Intersection Graph of a Module
TL;DR: In this article, the authors studied the combinatorial properties of the intersection graph of a left $R$-module with unit edges and showed that it is connectedness, domination, finiteness, coloring, and planarity.
Journal ArticleDOI
Hadamard matrices and their applications: Progress 2007---2010
TL;DR: Advances in 20 specific problems and several new research directions are outlined, especially cocyclic Hadamard matrices, their generalisations and applications, made over the past three years.
Journal ArticleDOI
Cross Ratio Graphs
TL;DR: A family of arc-transitive graphs is studied in this paper, where the vertices of these graphs are ordered pairs of distinct points from a finite projective line, and adjacency is defined in terms of the cross ratio.
References
More filters
Journal ArticleDOI
Equilateral point sets in elliptic geometry
J.H. van Lint,J.J. Seidel +1 more
TL;DR: In this paper, the authors highlight equilateral point sets in elliptic geometry and show that Paley's construction may be reversed to obtain a C -matrix of order 46, in view of the existence of a Hadamard matrix of order 92.
BookDOI
On construction and identification of graphs
TL;DR: The problem of graph identification has been studied in the theory of permutation groups for a long time, see as mentioned in this paper for a discussion of the main points of the problem and an algorithm for graph identification.