Joyentanuj Das

activity

20192026

most citedCounterexample to the Bougard-Joret Conjecture

5 citations · 5 across the 18 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

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

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…

On Squared Distance Matrix of Complete Multipartite Graphs

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

Distance Matrix of Weighted Cactoid-type Digraphs

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