\((0,\lambda)\)-graphs and \(n\)-cubes (Q755594): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 / rank
 
Normal rank

Latest revision as of 02:24, 13 June 2024

scientific article
Language Label Description Also known as
English
\((0,\lambda)\)-graphs and \(n\)-cubes
scientific article

    Statements

    \((0,\lambda)\)-graphs and \(n\)-cubes (English)
    0 references
    1979
    0 references
    graph
    0 references
    diameter
    0 references
    degree
    0 references

    Identifiers