Distance matrix of a class of completely positive graphs: determinant and inverse (Q828089): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1515/spma-2020-0109 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3036983409 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1906.04636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and matrices / 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: Inverse of the distance matrix of a block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / 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: Distance matrix polynomials of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse of the distance matrix of a cactoid digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse of the distance matrix of a bi-block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance matrix of a tree with weights on its arcs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/SPMA-2020-0109 / rank
 
Normal rank

Latest revision as of 04:20, 10 December 2024

scientific article
Language Label Description Also known as
English
Distance matrix of a class of completely positive graphs: determinant and inverse
scientific article

    Statements

    Distance matrix of a class of completely positive graphs: determinant and inverse (English)
    0 references
    0 references
    0 references
    14 January 2021
    0 references
    completely positive graphs
    0 references
    Schur complement
    0 references
    Laplacian matrix
    0 references
    distance matrix
    0 references

    Identifiers