\((0, 2)\)-graphs and root systems (Q2249917): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58919290, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3963102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of small \((0,2)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of the (0, 2)-graphs of valency 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5662096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized hexagons and a near octagon whose lines have three points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lie algebra cohomology and the generalized Borel-Weil theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((0,\lambda)\)-graphs and \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectagraphs, Diagrams, and Suzuki's Sporadic Simple Group / rank
 
Normal rank

Latest revision as of 17:00, 8 July 2024

scientific article
Language Label Description Also known as
English
\((0, 2)\)-graphs and root systems
scientific article

    Statements

    \((0, 2)\)-graphs and root systems (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    Summary: We construct \((0, 2)\)-graphs from root systems with simply laced diagram and study their properties.
    0 references
    root systems with simply laced diagram
    0 references

    Identifiers