P. Panigrahi

collaborators

4 papers

math.CO2026

$A_{I^} \pm$ -Spectra of $Q$ - and $T$ -Join Graphs with Applications to Cospectral Constructions

Mainak Basunia, Pratima Panigrahi

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

math.CO2026

Exploring new upper and lower bounds for the $A_{I^} \pm$ -energy of graphs

Mainak Basunia, Pratima Panigrahi

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

math.CO2026

Characterizing tricyclic graphs with pendant vertices having largest $A_{I^} \pm$ -spectral radius

Mainak Basunia, Pratima Panigrahi

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

math.CO2025

A method to optimize antipodal coloring span of graphs and its application

Kush Kumar, Pratima Panigrahi

In this article, we study radio $k$-colorings of simple connected graphs $G$ with diameter $d$, where a radio $k$-coloring $g$ assigns non-negative integers to $V(G)$ (…

AI^​±-Spectra of Q- and T-Join Graphs with Applications to Cospectral Constructions

Exploring new upper and lower bounds for the AI^​±-energy of graphs

Characterizing tricyclic graphs with pendant vertices having largest AI^​±-spectral radius

A method to optimize antipodal coloring span of graphs and its application

$A_{I^} \pm$ -Spectra of $Q$ - and $T$ -Join Graphs with Applications to Cospectral Constructions

Exploring new upper and lower bounds for the $A_{I^} \pm$ -energy of graphs

Characterizing tricyclic graphs with pendant vertices having largest $A_{I^} \pm$ -spectral radius