Inverse of the distance matrix of a bi-block graph (Q5741223): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
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
22 July 2016
0 references
distance matrix
0 references
complete bipartite graph
0 references
determinant
0 references
inverse
0 references