Distance matrix of a class of completely positive graphs: determinant and inverse (Q828089): Difference between revisions

@@ Property / cites work @@
+Graphs and matrices
@@ Property / cites work: Graphs and matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A \(q\)-analogue of the distance matrix of a tree
@@ Property / cites work: A \(q\)-analogue of the distance matrix of a tree / rank @@
+Normal rank
@@ Property / cites work @@
+The distance matrix of a bidirected tree
@@ Property / cites work: The distance matrix of a bidirected tree / 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 @@
+Q4405832
@@ Property / cites work: Q4405832 / 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 @@
+Distance matrix polynomials of trees
@@ Property / cites work: Distance matrix polynomials of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse of the distance matrix of a cactoid digraph
+Normal rank
@@ Property / cites work @@
+Inverse of the distance matrix of a bi-block graph
+Normal rank
@@ Property / cites work @@
+The distance matrix of a tree with weights on its arcs
+Normal rank