A geometrical characterization of strongly regular graphs (Q1758461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Euclidean tight 4-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the cardinality of an s-distance subset in real Euclidean space. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong non-rigidity of certain tight Euclidean designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on sets with few distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs having strongly regular subconstituents / rank
 
Normal rank
Property / cites work
 
Property / cites work: 9-Point and 7-Point Configurations in 3-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher type inequalities for Euclidean t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and the 2-rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherent algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block matrices and multispherical structure of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal properties of spherical semidesigns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multispherical Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: New maximal two-distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclidean designs and potential energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical two-distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on three- and higher-distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Euclidean representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of three-distance sets in two dimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circum-Euclidean distance matrices and faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4654210 / rank
 
Normal rank

Latest revision as of 20:16, 5 July 2024

scientific article
Language Label Description Also known as
English
A geometrical characterization of strongly regular graphs
scientific article

    Statements

    A geometrical characterization of strongly regular graphs (English)
    0 references
    0 references
    0 references
    9 November 2012
    0 references
    strongly regular graph
    0 references
    distance matrix
    0 references
    distance geometry
    0 references
    \(s\)-distance set
    0 references
    representable graph
    0 references
    Euclidean representation
    0 references
    Euclidean \(t\)-design
    0 references
    spherical \(t\)-design
    0 references
    Euclidean codes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers