YASIR AHMAD

Dr. YASIR AHMAD

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
8 August 2016 in The European Physical Journal C
Verified
Journal Article
Open access
PDF file
MZMuhammad Zubair
Muhammad Zubair
SWSaira Waheed
Saira Waheed
YAYASIR AHMAD
YASIR AHMAD

10 January 2024 in Heliyon
Verified
Journal Article
Open access
UAUmar Ali
Umar Ali
JLJunxiang Li
Junxiang Li
YAYASIR AHMAD
YASIR AHMAD
ZRZahid Raza
Zahid Raza
The Laplacian spectrum significantly contributes the study of the structural features of non-regular networks. Actually, it emphasizes the interaction among the network eigenvalues and their structural properties. Let Pn(Pn′) represent the pentagonal-derivation cylinder (Möbius) network. In this article, based on the decomposition techniques of the Laplacian characteristic polynomial, we initially determine that the Laplacian spectra of Pn contain the eigenvalues of matrices LR and LS. Furthermore, using the relationship among the coefficients and roots of these two matrices, explicit calculations of the Kirchhoff index and spanning trees of Pn are determined. The relationship between the Wiener and Kirchhoff indices of Pn is also established.

25 April 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
YAYASIR AHMAD
YASIR AHMAD
UAUmar Ali
Umar Ali
DODaniele Ettore Otera
Daniele Ettore Otera
XPXiangfeng Pan
Xiangfeng Pan
The use of the global mean first-passage time (GMFPT) in random walks on networks has been widely explored in the field of statistical physics, both in theory and practical applications. The GMFPT is the estimated interval of time needed to reach a state j in a system from a starting state i. In contrast, there exists an intrinsic measure for a stochastic process, known as Kemeny’s constant, which is independent of the initial state. In the literature, it has been used as a measure of network efficiency. This article deals with a graph-spectrum-based method for finding both the GMFPT and Kemeny’s constant of random walks on spiro-ring networks (that are organic compounds with a particular graph structure). Furthermore, we calculate the Laplacian matrix for some specific spiro-ring networks using the decomposition theorem of Laplacian polynomials. Moreover, using the coefficients and roots of the resulting matrices, we establish some formulae for both GMFPT and Kemeny’s constant in these spiro-ring networks.

30 March 2026 in International Journal of Geometric Methods in Modern Physics
Verified
Journal Article
Closed access
PDF file
YAYASIR AHMAD
YASIR AHMAD
MZM. Zubair
M. Zubair
SWSaira Waheed
Saira Waheed
ZHZinnat Hassan
Zinnat Hassan
SSSania Sobedar
Sania Sobedar
Pradyumn Kumar SahooPradyumn Kumar Sahoo
Pradyumn Kumar Sahoo