Inverse of the distance matrix of a block graph (Q3104566): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: On the distance matrix of a directed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distance matrix polynomials of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(q\)-analogs of distance matrices of 3-hypertrees / rank | |||
Normal rank | |||
Latest revision as of 18:27, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse of the distance matrix of a block graph |
scientific article |
Statements
Inverse of the distance matrix of a block graph (English)
0 references
14 December 2011
0 references
distance matrix
0 references
determinant
0 references
Laplacian matrix
0 references
