Steiner distance matrix of caterpillar graphs (Q2125582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1515/spma-2022-0162 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Distance matrix polynomials of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance matrices and Laplacians / 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: An inverse formula for the distance matrix of a wheel graph with an even number of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance matrices of wheel graphs with an odd number of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/SPMA-2022-0162 / rank
 
Normal rank

Latest revision as of 03:54, 17 December 2024

scientific article
Language Label Description Also known as
English
Steiner distance matrix of caterpillar graphs
scientific article

    Statements

    Steiner distance matrix of caterpillar graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2022
    0 references
    Steiner tree
    0 references
    caterpillar graph
    0 references
    determinant
    0 references
    rank of a matrix
    0 references
    Laplacian matrices
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references