A \(q\)-analogue of the distance matrix of a tree (Q2496651): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On distance matrices and Laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some inverse problems for elliptic matrices with zero diagonal / 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: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral graph theory and the inverse eigenvalue problem of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank

Latest revision as of 18:13, 24 June 2024

scientific article
Language Label Description Also known as
English
A \(q\)-analogue of the distance matrix of a tree
scientific article

    Statements

    A \(q\)-analogue of the distance matrix of a tree (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2006
    0 references
    0 references
    tree
    0 references
    distance matrix
    0 references
    Laplacian matrix
    0 references
    determinant
    0 references
    block matrix
    0 references
    0 references