Inverse Formulae for $q$-analogues of Bipartite Distance Matrix
Author:
Preprint
Abstract
We consider two distinct $q$-analogues of the bipartite distance matrix, namely the $q$-bipartite distance matrix and the exponential distance matrix. We provide formulae of the inverse for these matrices, which extend the existing results for the bipartite distance matrix. These investigations lead us to introduce a $q$-analogue version of the bipartite Laplacian matrix.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A q-analogue of the bipartite distance matrix of a nonsingular treeDiscrete Mathematics, 2022
- Inverses of Bipartite GraphsCombinatorica, 2017
- The determinants of q-distance matrices of trees and two quantities relating to permutationsAdvances in Applied Mathematics, 2007
- Determinant of the distance matrix of a tree with matrix weightsLinear Algebra and its Applications, 2006
- A q-analogue of the distance matrix of a treeLinear Algebra and its Applications, 2006
- On distance matrices and LaplaciansLinear Algebra and its Applications, 2005
- Inverses of treesCombinatorica, 1985
- Distance matrix polynomials of treesAdvances in Mathematics, 1978
- On the distance matrix of a directed graphJournal of Graph Theory, 1977
- On the Addressing Problem for Loop SwitchingBell System Technical Journal, 1971