Inverse of the distance matrix of a cactoid digraph (Q2347341): 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: A \(q\)-analogue of the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance matrix of a bidirected tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of \(q\)-distance matrices of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse of the distance matrix of a block graph / 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: \(q\)-analogs of distance matrices of 3-hypertrees / rank
 
Normal rank

Latest revision as of 03:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Inverse of the distance matrix of a cactoid digraph
scientific article

    Statements

    Inverse of the distance matrix of a cactoid digraph (English)
    0 references
    0 references
    0 references
    27 May 2015
    0 references
    cactoid digraph
    0 references
    distance matrix
    0 references
    Laplacian matrix
    0 references
    inverse
    0 references

    Identifiers