Amir Rehman

collaborators

2 papers

math.CO2026

The spectral extrema of graphs of odd size forbidding $H (4, 3)$ beyond the book graph

Abdul Basit Wani, S. Pirzada, Amir Rehman

A graph is said to be $H$ -free if it does not contain a subgraph isomorphic to $H$ . The fish graph, denoted by $H (4, 3)$ , is a $6 -$ vertex graph obtained from a cycle of length $4$ …

math.CO2024

On maximum spectral radius of ${H (3, 3), H (4, 3)}$ -free graphs

Amir Rehman, S. Pirzada

Let $G$ be a simple connected graph of size $m$ . Let $A$ be the adjacency matrix of $G$ and let $ρ (G)$ be the spectral radius of $G$ . A graph is said to be $H$ -free if it does not…

The spectral extrema of graphs of odd size forbidding H(4,3) beyond the book graph

On maximum spectral radius of {H(3,3), H(4,3)}-free graphs

The spectral extrema of graphs of odd size forbidding $H (4, 3)$ beyond the book graph

On maximum spectral radius of ${H (3, 3), H (4, 3)}$ -free graphs