Hilal Ahmad

Dr. Hilal Ahmad

Mathematics, University of Kashmir, Srīnagar, Jammu and Kashmīr, International
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2015 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada
Hilal AhmadHilal Ahmad
Hilal Ahmad

1 May 2018 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
Hilal AhmadHilal Ahmad
Hilal Ahmad
BCBilal A. Chat
Bilal A. Chat
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada

1 September 2017 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
Hilal AhmadHilal Ahmad
Hilal Ahmad
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada

1 June 2014 in Acta Universitatis Sapientiae, Informatica
Verified
Journal Article
Open access
PDF file
Hilal AhmadHilal Ahmad
Hilal Ahmad
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada
AIAntal Iványi
Antal Iványi
For a graph G with vertex set V(G) = {v1, v2, . . . , vn}, the extended double cover G* is a bipartite graph with bipartition (X, Y), X = {x1, x2, . . . , xn} and Y = {y1, y2, . . . , yn}, where two vertices xi and yj are adjacent if and only if i = j or vi adjacent to vj in G. The double graph D[G] of G is a graph obtained by taking two copies of G and joining each vertex in one copy with the neighbors of corresponding vertex in another copy. In this paper we study energy and Laplacian energy of the graphs G* and D[G], L-spectra of Gk* the k-th iterated extended double cover of G. We obtain a formula for the number of spanning trees of G*. We also obtain some new families of equienergetic and L-equienergetic graphs.

15 January 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
AAAbdollah Alhevaz
Abdollah Alhevaz
MBMaryam Baghipur
Maryam Baghipur
Hilal AhmadHilal Ahmad
Hilal Ahmad
Yilun ShangYilun Shang
Yilun Shang
Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D ( G ) and diagonal matrix of the vertex transmissions T r ( G ) . We determine the spectrum of the join of two graphs and of the join of a regular graph with another graph, which is the union of two different regular graphs. Moreover, thanks to the symmetry of the matrices involved, we study the generalized distance spectrum of the graphs obtained by generalization of the join graph operation through their eigenvalues of adjacency matrices and some auxiliary matrices.

12 November 2019 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
AAAbdollah Alhevaz
Abdollah Alhevaz
MBMaryam Baghipur
Maryam Baghipur
Hilal AhmadHilal Ahmad
Hilal Ahmad
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada
Let G be a simple connected graph with n vertices, m edges and having distance signless Laplacian eigenvalues ρ1≥ρ2≥…≥ρn≥0. For 1≤k≤n, let Mk(G)=∑i=1kρi and Nk(G)=∑i=0k−1ρn−i be respectively the sum of k-largest distance signless Laplacian eigenvalues and the sum of k-smallest distance signless Laplacian eigenvalues of G. In this paper, we obtain the bounds for Mk(G) and Nk(G) in terms of the number of vertices n and the transmission σ(G) of the graph G. We propose a Brouwer-type conjecture for Mk(G) and show that it holds for graphs of diameter one and graphs of diameter two for all k. As a consequence, we observe that the conjecture holds for threshold graphs and split graphs (of diameter two). We also show that it holds for k = n−1 and n for all graphs and for some k for r-transmission regular graphs.