Computing the determinant of the distance matrix of a bicyclic graph (Q2132376): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113317395, #quickstatements; #temporary_batch_1711055989931 |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.entcs.2019.08.037 / 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: On the Addressing Problem for Loop Switching / 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 / DOI | |||
Property / DOI: 10.1016/J.ENTCS.2019.08.037 / rank | |||
Normal rank |
Latest revision as of 05:30, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the determinant of the distance matrix of a bicyclic graph |
scientific article |
Statements
Computing the determinant of the distance matrix of a bicyclic graph (English)
0 references
27 April 2022
0 references
bicyclic graphs
0 references
determinant
0 references
distance matrix
0 references