A q-analogous of the characterization of hypercubes as graphs (Q762493): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Undirected Graphs Realizable as Graphs of Modular Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of hypercubes / rank
 
Normal rank

Revision as of 15:56, 14 June 2024

scientific article
Language Label Description Also known as
English
A q-analogous of the characterization of hypercubes as graphs
scientific article

    Statements

    A q-analogous of the characterization of hypercubes as graphs (English)
    0 references
    1984
    0 references
    The author gives an interesting arithmetical characterization of graphs which are realizable as graphs of the lattice of the subspaces of a projective space of finite dimension and of finite order \(q\geq 1\). This characterization may be considered as a q-analogous of the characterization of hypercubes given by \textit{S. Foldes} [Discrete Math. 17, 155-159 (1977; Zbl 0354.05045)].
    0 references
    Gaussian numbers
    0 references
    graphs of the lattice of the subspaces of a projective
    0 references

    Identifiers