activity
20212026
most citedOn -spectrum of joined union of graphs and its applications to power graphs of finite groups

2 citations · 4 across the 8 of their papers we have counts for

collaborators

11 papers

math.RA2026

Multiplicity-One Structure in Graded Zero-Divisor Graphs

M. Aijaz, Shahnawaz A. Rather, S Pirzada

Let \(H\) be a multiplicative group, \(R\) a commutative \(H\)-graded ring, and \(M\) a nonzero finitely generated gr-semisimple \(H\)-graded \(R\)-module. We assume that \(M\) adm…

math.AC2026

Binomial edge ideals of bipartite complements of even cycles

Shahnawaz Ahmad Rather, S. Pirzada, M. Aijaz

Let be the bipartite complement of the even cycle , and let be its binomial edge ideal. For , we study the interaction between the combinatorial str…

math.AC2026

Homological invariants of Edge Ideals associated to powers of cycles

Shahnawaz Ahmad Rather, S. Pirzada, M. Aijaz

Let $G_{n,m}=\overline{\C_n^{[m]}}$, where $\C_n^{[m]}$ denotes the closed th power of the -cycle. We study the graded Betti numbers and homological invariants of the edge ri…

math.CO2026

On distance integral and distance Laplacian integral graphs

S. Pirzada, Ummer Mushtaq, Leonardo de Lima

Let be a connected graph on vertices and let and be the distance and the distance Laplacian matrices associated with . A graph is said to be -in…

math.CO2026

The spectral extrema of graphs of odd size forbidding beyond the book graph

Abdul Basit Wani, S. Pirzada, Amir Rehman

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

math.CO2025

On connected graphs with finite spectral redundancy index and Pythagorean triplets

Pawan Kumar, S. Pirzada, S. Merajuddin

This article investigates spectral redundancy, a concept initially introduced by Alberto Seeger. Spectral redundancy arises when different connected induced subgraphs of a graph sh…

math.SP2023

On the eigenvalues and energy of the -matrix of graphs

Nijara Konch, A. Bharali, S. Pirzada

For a graph , the generalized adjacency matrix is the convex combination of the diagonal matrix and the adjacency matrix and is defined as $A_α(G)=αD(G)+(…

math.CO2022★ 1 cited

On distance Laplacian spread and Wiener index of a graph

Saleem Khan, S. Pirzada

Let be a simple connected simple graph of order . The distance Laplacian matrix is defined as , where is the diagonal matrix of v…

math.CO2022

On the distribution of eigenvalues of the reciprocal distance Laplacian matrix of graphs

S. Pirzada, Saleem Khan

The reciprocal distance Laplacian matrix of a connected graph is defined as , where is the diagonal matrix of reciprocal distance degrees and $RD(G…

math.CO2022★ 1 cited

Distance Laplacian eigenvalues of graphs and chromatic and independence number

S. Pirzada, Saleem Khan

For a connected graph of order , let be the diagonal matrix of vertex transmissions and be the distance matrix of . The distance Laplacian matrix of …

math.CO2021★ 2 cited

On -spectrum of joined union of graphs and its applications to power graphs of finite groups

Bilal A. Rather, Hilal A. Ganie, S. Pirzada

For a simple graph , the generalized adjacency matrix is defined as , where is the adjacency matrix and is the diagona…