Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
S. Pirzada
Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India
Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn S. Pirzada; Bilal A. Rather; T. A. Chishti; U. Samee
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2021.9.2.7

Abstract

For a finite commutative ring ℤn with identity 1 ≠ 0, the zero divisor graph Γ(ℤn) is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices x and y are adjacent if and only if xy=0. We find the normalized Laplacian spectrum of the zero divisor graphs Γ(ℤn) for various values of n and characterize n for which Γ(ℤn) is normalized Laplacian integral. We also obtain bounds for the sum of graph invariant Sβ*(G)-the sum of the β-th power of the non-zero normalized Laplacian eigenvalues of Γ(ℤn).
Bounds for graph energy in terms of vertex covering and clique numbers Hilal A. Ganie; U. Samee; S. Pirzada; Ahmad M. Alghamadi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2019.7.2.9

Abstract

Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of the vertex covering number τ, the clique number ω, the number of edges m, maximum vertex degree d1 and second maximum vertex degree d2 of the connected graph G. These upper bounds improve some of the recently known upper bounds.
Co-Authors Ahmad M. Alghamadi Bilal A. Rather Hilal A. Ganie T. A. Chishti U. Samee U. Samee