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 2023Show all

4 papers · 1 filter

math.CO2023

On the maximum $A_{α}$ -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices

Joyentanuj Das, Iswar Mahato

For a connected graph $G$ , let $A (G)$ be the adjacency matrix of $G$ and $D (G)$ be the diagonal matrix of the degrees of the vertices in $G$ . The $A_{α}$ -matrix of $G$ is defined as…

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

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…

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…

On the maximum Aα​-spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices

Inverse of the Squared Distance Matrix of a Complete Multipartite Graph

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

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

On the maximum $A_{α}$ -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices