1 citations · 1 across the 10 of their papers we have counts for
12 papers
Multimodal motion and behavior switching of multistable ciliary walkers
Sumit Mohanty, Paul Baconnier, Harmannus A. H. Schomaker +3
The collective motion of arrays of cilia - tiny, hairlike protrusions - drives the locomotion of numerous microorganisms, enabling multimodal motion and autonomous switching betwee…
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…
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…
Inverse of the Squared Distance Matrix of a Complete Multipartite Graph
Joyentanuj Das, Sumit Mohanty
Let be a connected graph on vertices and be the length of the shortest path between vertices and in . We set for every vertex in . The…
Maximization of the spectral radius of block graphs with a given dissociation number
Joyentanuj Das, Sumit Mohanty
A connected graph is called a block graph if each of its blocks is a complete graph. Let be the class of block graphs on vertices with giv…
On Squared Distance Matrix of Complete Multipartite Graphs
Joyentanuj Das, Sumit Mohanty
Let be a complete -partite graph on vertices. The distance between vertices and in , denoted by is defined…
Trees with Matrix Weights: Laplacian Matrix and Characteristic-like Vertices
Swetha Ganesh, Sumit Mohanty
It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover,…
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…