M. Basunia

collaborators

4 papers

math.CO2026

Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs

Mainak Basunia, Pratima Panigrahi

Spectral Turán-type problems ask how the absence of prescribed subgraphs constrains the spectral radius of a matrix associated with a graph. Given a family of graphs $F$ ,…

math.CO2026

$A_{α}$ -Spectra of $Q$ - and $T$ -Join Graphs with Applications to Cospectral Constructions

Mainak Basunia, Pratima Panigrahi

For $α \in [0, 1]$ , the $A_{α}$ -matrix of a graph $G$ is defined by $A_{α} (G) = α D (G) + (1 - α) A (G)$ , where $A (G)$ and $D (G)$ denote the adjacency matrix and the diagonal degree matrix o…

math.CO2026

Exploring new upper and lower bounds for the $A_{α}$ -energy of graphs

Mainak Basunia, Pratima Panigrahi

Let $G$ be a graph on $n$ vertices and $m$ edges. For $α \in [0, 1]$ , the $A_{α}$ -matrix of $G$ is defined as $A_{α} (G) = α D (G) + (1 - α) A (G)$ , where $A (G)$ is the adjacency matrix and $…

math.CO2026

Characterizing tricyclic graphs with pendant vertices having largest $A_{α}$ -spectral radius

Mainak Basunia, Pratima Panigrahi

For a graph $G$ with adjacency matrix $A (G)$ and degree diagonal matrix $D (G)$ , the $A_{α}$ -matrix of $G$ is defined as \begin{equation*} A_α(G) = αD(G) + (1- α) A(G), \text{ for any…

Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs

Aα​-Spectra of Q- and T-Join Graphs with Applications to Cospectral Constructions

Exploring new upper and lower bounds for the Aα​-energy of graphs

Characterizing tricyclic graphs with pendant vertices having largest Aα​-spectral radius

$A_{α}$ -Spectra of $Q$ - and $T$ -Join Graphs with Applications to Cospectral Constructions

Exploring new upper and lower bounds for the $A_{α}$ -energy of graphs

Characterizing tricyclic graphs with pendant vertices having largest $A_{α}$ -spectral radius