Let $G$ be a strongly connected digraph with vertex set $\{v_1, v_2, \dots, v_n\}$. Denote by $D_{ij}$ the distance between vertices $v_i$ and $v_j$ in $G$. Two variant versions of matrix were proposed Yan Yeh (Adv. Appl. Math.), Bapat et al. (Linear Algebra Appl.) independently, one is $q$-distance matrix, other exponential matrix. Given nonzero indeterminate $q$, $\mathscr{D}_G=(\mathscr{D}_{...

Graham, Hoffman and Hosoya gave a very nice formula about the determinant of the distance matrix DG of a graph G in terms of the distance matrix of its blocks. We generalize this result to a q-analogue of DG. Our generalization yields results about the equality of the determinant of the mod-2 (and in general mod-k) distance matrix (i.e. each entry of the distance matrix is taken modulo 2 or k) ...

the relationship between the randic , wiener, hosoya , balaban, schultz indices, harary numbers anddistance matrix to enthalpies of formation (airf), heat capacity, (cp) , enthalpies of combustion (ah °c ),enthalpy of vaporization (ah °vap) and normal boiling points (bpk)of c2 c10 normal alkanes isrepresented