From the 1 of 9 linked papers with an AI index.
9 papers
A higher-connectivity spectral Ore theorem for triangle-free graphs
Joyentanuj Das, Sayan Gupta
Let be the graph obtained from the balanced complete bipartite graph on vertices by deleting a matching of size . If is an -vertex triangle-free graph with…
A sharp fixed-size spectral bound for -free graphs
Joyentanuj Das, Yamini V
For a fixed integer , we establish a sharp adjacency-spectral upper bound for sufficiently large -edge -free graphs. We prove \[ λ(G)\le (k-1)+\sqrt{m-k(k-1)}. \] M…
Laplacian Bounds for the Dissociation Number of Regular Graphs of Matrix Rings
Joyentanuj Das
The paper investigates the maximum size of a dissociation set in the graph of invertible matrices over a finite field, using Laplacian eigenvalue bounds and character sum technique…
On the minimum spectral radius of unicyclic graphs with a given matching number
Joyentanuj Das, Debabrota Mondal
A matching in a graph is a set of edges such that no two edges in share a common vertex. A matching with maximum cardinality is called a maximum matching and i…
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…
A -analogue of distance matrix of bi-block graphs
Joyentanuj Das
A -analogue of the distance matrix, referred to as the \emph{-distance matrix}, is obtained from the distance matrix by replacing each nonzero entry with the sum $1+q+\c…