An inverse formula for the distance matrix of a wheel graph with an even number of vertices (Q2228113): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Euclidean Distance Matrices and Their Applications in Rigidity Theory / 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: Distance matrix polynomials of trees / 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: Euclidean graph distance matrices of generalizations of the star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance matrices of some graphs related to wheel graphs / rank
 
Normal rank

Revision as of 14:18, 24 July 2024

scientific article
Language Label Description Also known as
English
An inverse formula for the distance matrix of a wheel graph with an even number of vertices
scientific article

    Statements

    An inverse formula for the distance matrix of a wheel graph with an even number of vertices (English)
    0 references
    0 references
    0 references
    0 references
    16 February 2021
    0 references
    wheel graphs
    0 references
    Laplacian matrices
    0 references
    distance matrices
    0 references
    circulant matrices
    0 references

    Identifiers