5 papers
On the spectral radius of bi-block graphs with given independence number
Joyentanuj Das, Sumit Mohanty
A connected graph is called a bi-block graph if each of its blocks is a complete bipartite graph. Let be the class of bi-block graph on ve…
Distance Matrix of Weighted Cactoid-type Digraphs
Joyentanuj Das, Sumit Mohanty
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article…
Distance Matrix of a Multi-block Graph: Determinant and Inverse
Joyentanuj Das, Sumit Mohanty
A connected graph is called a multi-block graph if each of its blocks is a complete multi-partite graph. Building on the work of \cite{Bp3,Hou3}, we compute the determinant and inv…
Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse
Joyentanuj Das, Sachindranath Jayaraman, Sumit Mohanty
A real symmetric matrix is said to be completely positive if it can be written as for some (not necessarily square) nonnegative matrix . A simple graph is called…
Combinatorial Heat and Wave Equations on Certain Classes of Infinite Cayley and Coset Graphs
S. Mohanty, A. K. Lal
The combinatorial heat and wave equations on all finite Cayley and coset graphs with discrete time variable was solved by Lal {\it et al}. In this paper, the results of the above p…