Inverse of the distance matrix of a bi-block graph (Q5741223): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03081087.2015.1099599 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1803416476 / 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: On distance matrices and Laplacians / 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 block graph / 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: Product distance matrix of a tree with matrix weights / 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: \(q\)-analogs of distance matrices of 3-hypertrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:38, 12 July 2024

scientific article; zbMATH DE number 6605440
Language Label Description Also known as
English
Inverse of the distance matrix of a bi-block graph
scientific article; zbMATH DE number 6605440

    Statements

    Inverse of the distance matrix of a bi-block graph (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    distance matrix
    0 references
    complete bipartite graph
    0 references
    determinant
    0 references
    inverse
    0 references

    Identifiers

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