A $q$-analogue of distance matrix of bi-block graphs

Abstract

A $q$-analogue of the distance matrix, referred to as the \emph{$q$-distance matrix}, is obtained from the distance matrix by replacing each nonzero entry $\alpha$ with the sum $1+q+\cdots +q^{\alpha -1}$. This notion was introduced independently by Bapat, Lal, and Pati~\cite{Ba-Lal-Pati}, and by Yan and Yeh~\cite{Yan}. A connected graph is called a \emph{bi-block graph} if each of its blocks is a complete bipartite graph. In this paper, we derive explicit formulas for the determinant and the inverse of the $q$-distance matrix of bi-block graphs. These results both generalize the corresponding formulas for the distance matrix of bi-block graphs obtained in~\cite{Hou3} and extend the results for block graphs in~\cite{Xing} to the class of bi-block graphs.

26 pages