Computing the determinant of the distance matrix of a bicyclic graph (Q2132376): Difference between revisions

@@ Property / DOI @@
-.1016/j.entcs.2019.08.037
@@ Property / DOI: 10.1016/j.entcs.2019.08.037 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q113317395
@@ Property / Wikidata QID: Q113317395 / rank @@
+Normal rank
@@ Property / cites work @@
+On distance matrices and Laplacians
@@ Property / cites work: On distance matrices and Laplacians / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse of the distance matrix of a block graph
@@ Property / cites work: Inverse of the distance matrix of a block graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the Addressing Problem for Loop Switching
@@ Property / cites work: On the Addressing Problem for Loop Switching / rank @@
+Normal rank
@@ Property / cites work @@
+On the distance matrix of a directed graph
@@ Property / cites work: On the distance matrix of a directed graph / rank @@
+Normal rank
@@ Property / cites work @@
+Distance matrix polynomials of trees
@@ Property / cites work: Distance matrix polynomials of trees / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENTCS.2019.08.037
@@ Property / DOI: 10.1016/J.ENTCS.2019.08.037 / rank @@
+Normal rank