A \(q\)-analogue of the distance matrix of a tree (Q2496651): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.laa.2005.12.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2065441125
@@ Property / OpenAlex ID: W2065441125 / 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 @@
+Q4344117
@@ Property / cites work: Q4344117 / rank @@
+Normal rank
@@ Property / cites work @@
+Some inverse problems for elliptic matrices with zero diagonal
+Normal rank
@@ Property / cites work @@
+Distance matrix polynomials of trees
@@ Property / cites work: Distance matrix polynomials of trees / 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 @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral graph theory and the inverse eigenvalue problem of a graph
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank