Joyentanuj Das

collaborators

3 papers

math.CO2025

A $q$ -analogue of distance matrix of bi-block graphs

Joyentanuj Das

A $q$ -analogue of the distance matrix, referred to as the \emph{ $q$ -distance matrix}, is obtained from the distance matrix by replacing each nonzero entry $α$ with the sum $1+q+\cd…

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

On the spectral radius of clique trees with a given zero forcing number

Joyentanuj Das

Let $G (n, k)$ be the class of clique trees on $n$ vertices and zero forcing number $k$ , where $⌊ \frac{n}{2} ⌋ + 1 \leq k \leq n - 1$ and each block is a clique…

A q-analogue of distance matrix of bi-block graphs

On the Squared Distance Matrix of a Starlike Block Graph

On the spectral radius of clique trees with a given zero forcing number

A $q$ -analogue of distance matrix of bi-block graphs