\(q\)-analogs of distance matrices of 3-hypertrees (Q837003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A \(q\)-analogue of the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance matrix of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix polynomials of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Pfaffian matrix-tree theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonintersecting paths, pfaffians, and plane partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of Graham and Pollak's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN / rank
 
Normal rank

Latest revision as of 23:32, 1 July 2024

scientific article
Language Label Description Also known as
English
\(q\)-analogs of distance matrices of 3-hypertrees
scientific article

    Statements

    \(q\)-analogs of distance matrices of 3-hypertrees (English)
    0 references
    10 September 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(q\)-analog
    0 references
    distance matrix
    0 references
    determinant
    0 references
    Pfaffian identity
    0 references
    trees
    0 references
    uniform hypergraphs
    0 references
    0 references