S. Mohanty

activity

20152025

most citedTrees with Matrix Weights: Laplacian Matrix and Characteristic-like Vertices

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing math.COShow all

11 papers · 1 filter

math.CO2025

The exponential distance matrix of bi-block graphs

Joyentanuj Das, Sumit Mohanty

Let $G$ be a connected graph with vertex set ${v_{1}, v_{2}, \dots, v_{n}}$ . As a variant of the classical distance matrix, the \emph{exponential distance matrix} was introdu…

math.CO2025

On the Squared Distance Matrix of a Starlike Block Graph

Joyentanuj Das, Sumit Mohanty

Let $D (G)$ be the distance matrix of a simple connected graph $G$ . The Hadamard product $D (G) \circ D (G)$ is called the squared distance matrix of $G$ , and is denoted by $Δ (G)$ . A…

math.CO2023

Inverse of the Squared Distance Matrix of a Complete Multipartite Graph

Joyentanuj Das, Sumit Mohanty

Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between vertices $i$ and $j$ in $G$ . We set $d_{ii} = 0$ for every vertex $i$ in $G$ . The…

math.CO2023

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 $Bl (k, φ)$ be the class of block graphs on $k$ vertices with giv…

math.CO2020

On Squared Distance Matrix of Complete Multipartite Graphs

Joyentanuj Das, Sumit Mohanty

Let $G = K_{n_{1}, n_{2}, \dots, n_{t}}$ be a complete $t$ -partite graph on $n = \sum_{i = 1}^{t} n_{i}$ vertices. The distance between vertices $i$ and $j$ in $G$ , denoted by $d_{ij}$ is defined…

math.CO2020★ 1 cited

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,…

math.CO2020

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 $B (k, α)$ be the class of bi-block graph on $k$ ve…

math.CO2020

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…

math.CO2019

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…

math.CO2019

Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse

Joyentanuj Das, Sachindranath Jayaraman, Sumit Mohanty

A real symmetric matrix $A$ is said to be completely positive if it can be written as $B B^{t}$ for some (not necessarily square) nonnegative matrix $B$ . A simple graph $G$ is called…

math.CO2015

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…

The exponential distance matrix of bi-block graphs

On the Squared Distance Matrix of a Starlike Block Graph

Inverse of the Squared Distance Matrix of a Complete Multipartite Graph

Maximization of the spectral radius of block graphs with a given dissociation number

On Squared Distance Matrix of Complete Multipartite Graphs

Trees with Matrix Weights: Laplacian Matrix and Characteristic-like Vertices

On the spectral radius of bi-block graphs with given independence number α

Distance Matrix of Weighted Cactoid-type Digraphs

Distance Matrix of a Multi-block Graph: Determinant and Inverse

Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse

Combinatorial Heat and Wave Equations on Certain Classes of Infinite Cayley and Coset Graphs

On the spectral radius of bi-block graphs with given independence number $α$