5 citations · 5 across the 18 of their papers we have counts for
4 papers · 1 filter
The exponential distance matrix of bi-block graphs
Joyentanuj Das, Sumit Mohanty
Let be a connected graph with vertex set . As a variant of the classical distance matrix, the \emph{exponential distance matrix} was introdu…
A -analogue of distance matrix of bi-block graphs
Joyentanuj Das
A -analogue of the distance matrix, referred to as the \emph{-distance matrix}, is obtained from the distance matrix by replacing each nonzero entry with the sum $1+q+\cd…
On the Squared Distance Matrix of a Starlike Block Graph
Joyentanuj Das, Sumit Mohanty
Let be the distance matrix of a simple connected graph . The Hadamard product is called the squared distance matrix of , and is denoted by . A…
Online Sparsification of Bipartite-Like Clusters in Graphs
Joyentanuj Das, Suranjan De, He Sun
Graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective of mos…