A geometrical characterization of strongly regular graphs

DOI10.1016/J.LAA.2012.05.040MaRDI QIDQ1758461zbMATH OpenOpenAlexFDO

Authors Hiroshi Nozaki, Masashi Shinohara

Publication date 9 November 2012

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2012.05.040

zbMATH Keywords

strongly regular graphdistance matrix\(s\)-distance setdistance geometryEuclidean representationspherical \(t\)-designrepresentable graphEuclidean \(t\)-designEuclidean codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Recommendations

• scientific article; zbMATH DE number 2187681
• Strongly regular graphs
• Euclidean Jordan Algebras and Strongly Regular Graphs
• scientific article; zbMATH DE number 782048
• Feasibility conditions on the parameters of a strongly regular graph

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3827893 (Why is no real title available?)
• scientific article; zbMATH DE number 3895787 (Why is no real title available?)
• scientific article; zbMATH DE number 4073090 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 2140363 (Why is no real title available?)
• scientific article; zbMATH DE number 796484 (Why is no real title available?)
• scientific article; zbMATH DE number 3234139 (Why is no real title available?)
• 9-Point and 7-Point Configurations in 3-Space
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Block matrices and multispherical structure of distance matrices
• Bounds on sets with few distances
• Bounds on three- and higher-distance sets
• Chromatic number and the 2-rank of a graph
• Circum-Euclidean distance matrices and faces
• Classification of three-distance sets in two dimensional Euclidean space
• Coherent algebras
• Developments in the theory of graph spectra
• Eigenspaces of graphs
• Extremal properties of spherical semidesigns
• Fisher type inequalities for Euclidean t-designs
• Matrix Analysis
• Minimal Euclidean representations of graphs
• Multispherical Euclidean distance matrices
• New maximal two-distance sets
• On Euclidean designs and potential energy
• On Euclidean tight 4-designs
• On the strong non-rigidity of certain tight Euclidean designs
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Spherical codes and designs
• Spherical two-distance sets
• Strongly regular graphs having strongly regular subconstituents

Cited in

(11)

• On representations of graphs as two-distance sets
• Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues
• Complex spherical codes with three inner products
• scientific article; zbMATH DE number 2187681 (Why is no real title available?)
• The two-distance sets in dimension four
• Binary representations of regular graphs
• Strongly regular graphs that are locally a disjoint union of hexagons
• Finite two-distance tight frames
• scientific article; zbMATH DE number 166092 (Why is no real title available?)
• A note on the spherical embeddings of strongly regular graphs
• Graphs and spherical two-distance sets

This page was built for publication: A geometrical characterization of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758461)