Abdollah Alhevaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Abdollah Alhevaz has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Maryam Baghipur
Faculty of mathematical sciences, Shahrood University of Technology, Shahrood, Iran
32 shared publications - Hilal Ahmad Ganie
Department of Mathematics, Government Degree College, Uri, Jammu and Kashmir, India
11 shared publications - Yilun Shang
School of Computer Science, Northumbria University, Newcastle upon Tyne, NE1 8ST, UK
11 shared publications - Ebrahim Hashemi
Shahrood University of Technology
10 shared publications E. Hashemi
Faculty of Mathematical Sciences, Shahrood University of Technology, P.O. Box: 316-3619995161, Shahrood, Iran
8 shared publicationsEbrahim Hashemi
Faculty of mathematical sciences, Shahrood University of Technology, Shahrood, Iran
8 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1) , 3429588
On Generalized Harary Eigenvalues and Generalized Join of Graphs
In this work, we further study the generalized Harary matrix of a connected graph G , which we denote by R D α ( G ). This matrix is defined as the convex combination R D α ( G ) = α R T ( G ) + (1 − α ) R D ( G ), where 0 ≤ α ≤ 1. In this formulation, R D ( G ) refers to the classical Harary matrix, and R T ( G ) represents a diagonal matrix of reciprocal transmission degrees of G . The construction of R D α ( G ) allows us to establish a unified framework that encompasses the spectral analysis of the Harary matrix and the reciprocal distance signless Laplacian matrix of G . Here, we determine the eigenvalues of R D α ( G ) for various graphs constructed via graph operations. Furthermore, we establish the generalized Harary spectrum for graphs formed by generalized join and lexicographic products, relating it to their adjacency spectrum. As an application, we determine the generalized Harary spectrum of power graphs of finite abelian groups. Furthermore, the generalized Harary auxiliary energy is investigated, leading to the construction of infinitely many pairwise equienergetic graphs.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1) , 3429588
Open AccessOn Generalized Harary Eigenvalues and Generalized Join of Graphs
In this work, we further study the generalized Harary matrix of a connected graph G , which we denote by R D α ( G ). This matrix is defined as the convex combination R D α ( G ) = α R T ( G ) + (1 − α ) R D ( G ), where 0 ≤ α ≤ 1. In this formulation, R D ( G ) refers to the classical Harary matrix, and R T ( G ) represents a diagonal matrix of reciprocal transmission degrees of G . The construction of R D α ( G ) allows us to establish a unified framework that encompasses the spectral analysis of the Harary matrix and the reciprocal distance signless Laplacian matrix of G . Here, we determine the eigenvalues of R D α ( G ) for various graphs constructed via graph operations. Furthermore, we establish the generalized Harary spectrum for graphs formed by generalized join and lexicographic products, relating it to their adjacency spectrum. As an application, we determine the generalized Harary spectrum of power graphs of finite abelian groups. Furthermore, the generalized Harary auxiliary energy is investigated, leading to the construction of infinitely many pairwise equienergetic graphs.
- 11 August 2025
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 56 (4) , 1478-1494
Energy of graphs with respect to generalized distance matrix: Extremal results and bounds
- 11 August 2025
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 56 (4) , 1478-1494
Energy of graphs with respect to generalized distance matrix: Extremal results and bounds
- Open Access
- 30 June 2025
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 17 (1) , 255-276
Some bounds for distance signless Laplacian energy-like invariant of networks
For a graph or network $G$, denote by $D(G)$ the distance matrix and $Tr(G)$ the diagonal matrix of vertex transmissions. The distance signless Laplacian matrix of $G$ is $D^{Q}(G)=Tr(G)+D(G)$. We introduce the distance signless Laplacian energy-like invariant as $DEL(G)=\sum_{i=1}^{n}\sqrt{\rho_{i}}$, where $\rho_{1}\geq\rho_{2}\geq \dots\geq \rho_{n}$ are the eigenvalues of distance signless Laplacian matrix. In this paper, we obtain new upper and lower bounds for $DEL(G)$. These bounds involve some important invariants including diameter, minimum and maximum transmission degree, distance signless Laplacian spectral radius and the Wiener index. Additionally, we characterize the extremal graphs attaining these bounds. Finally, we establish some relations between different versions of distance signless Laplacian energy of graphs.- 30 June 2025
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 17 (1) , 255-276
Open AccessSome bounds for distance signless Laplacian energy-like invariant of networks
For a graph or network $G$, denote by $D(G)$ the distance matrix and $Tr(G)$ the diagonal matrix of vertex transmissions. The distance signless Laplacian matrix of $G$ is $D^{Q}(G)=Tr(G)+D(G)$. We introduce the distance signless Laplacian energy-like invariant as $DEL(G)=\sum_{i=1}^{n}\sqrt{\rho_{i}}$, where $\rho_{1}\geq\rho_{2}\geq \dots\geq \rho_{n}$ are the eigenvalues of distance signless Laplacian matrix. In this paper, we obtain new upper and lower bounds for $DEL(G)$. These bounds involve some important invariants including diameter, minimum and maximum transmission degree, distance signless Laplacian spectral radius and the Wiener index. Additionally, we characterize the extremal graphs attaining these bounds. Finally, we establish some relations between different versions of distance signless Laplacian energy of graphs. - Open Access
- 21 May 2025
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 12 (2) , 127-152
The Additive constacyclic codes and the MacWilliams identities over mixed alphabets
Let $\mathbb{Z}_p$ be the ring of integers modulo a prime integer $p$, where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle u^2\rangle}$ and $\mathcal{S}=\frac{\mathbb{Z}_p[u]}{\langle u^3\rangle}$. We also study additive constacyclic codes over $\mathcal{R}\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S}$ using the generator polynomials over the rings $\mathcal{R}$ and $\mathcal{S},$ respectively. Further, by defining Gray maps on $\mathcal{R}$, $\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S},$ we obtain some results on the Gray images of additive codes. Then we provide the weight enumeration and MacWilliams identities corresponding to the additive codes over $\mathbb{Z}_p\mathcal{R}\mathcal{S}$.- 21 May 2025
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 12 (2) , 127-152
Open AccessThe Additive constacyclic codes and the MacWilliams identities over mixed alphabets
Let $\mathbb{Z}_p$ be the ring of integers modulo a prime integer $p$, where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle u^2\rangle}$ and $\mathcal{S}=\frac{\mathbb{Z}_p[u]}{\langle u^3\rangle}$. We also study additive constacyclic codes over $\mathcal{R}\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S}$ using the generator polynomials over the rings $\mathcal{R}$ and $\mathcal{S},$ respectively. Further, by defining Gray maps on $\mathcal{R}$, $\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S},$ we obtain some results on the Gray images of additive codes. Then we provide the weight enumeration and MacWilliams identities corresponding to the additive codes over $\mathbb{Z}_p\mathcal{R}\mathcal{S}$. - 19 February 2025
- Published by Springer Nature in Acta Universitatis Sapientiae, Mathematica
- Vol. 16 (1) , 23-41
On the spectral radius of Dα-matrix of a connected graph
In this paper, we further study the convex combinations Dα(G) of Tr(G) and D(G), defined as Dα(G) = αTr(G)+(1−α)D(G), 0 ≤ α ≤ 1, where D(G) and Tr(G) denote the distance matrix and diagonal matrix of the vertex transmissions of a simple connected graph G, respectively. We obtain some upper and lower bounds for the spectral radius of the generalized distance matrix, in terms of various graph parameters and characterize the extremal graphs. We also obtain a lower bound for the generalized distance spectral radius of a graph with given edge connectivity, in terms of the order n, the edge connectivity r and the parameter α. Further, we obtain a lower bound for the generalized distance spectral radius of a tree, in terms of the order n, the diameter d and the parameter α. We characterize the extremal graphs for some values of diameter d.
- 19 February 2025
- Published by Springer Nature in Acta Universitatis Sapientiae, Mathematica
- Vol. 16 (1) , 23-41
On the spectral radius of Dα-matrix of a connected graph
In this paper, we further study the convex combinations Dα(G) of Tr(G) and D(G), defined as Dα(G) = αTr(G)+(1−α)D(G), 0 ≤ α ≤ 1, where D(G) and Tr(G) denote the distance matrix and diagonal matrix of the vertex transmissions of a simple connected graph G, respectively. We obtain some upper and lower bounds for the spectral radius of the generalized distance matrix, in terms of various graph parameters and characterize the extremal graphs. We also obtain a lower bound for the generalized distance spectral radius of a graph with given edge connectivity, in terms of the order n, the edge connectivity r and the parameter α. Further, we obtain a lower bound for the generalized distance spectral radius of a tree, in terms of the order n, the diameter d and the parameter α. We characterize the extremal graphs for some values of diameter d.
- 27 June 2024
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 53 (3) , 704-713
On sum annihilator ideals in Ore extensions
A ring $R$ is called a left Ikeda-Nakayama ring (left IN-ring) if the right annihilator of the intersection of any two left ideals is the sum of the two right annihilators. As a generalization of left IN-rings, a ring $R$ is called a right SA-ring if the sum of right annihilators of two ideals is a right annihilator of an ideal of $R$. It would be interesting to find conditions under which an Ore extension $R[x; \alpha, \delta]$ is IN and SA. In this paper, we will present some necessary and sufficient conditions for the Ore extension $R[x;\alpha, \delta]$ to be left IN or right SA. In addition, for an $(\alpha,\delta)$-compatible ring $R$, it is shown that: (i) If $S = R[x;\alpha,\delta]$ is a left IN-ring with ${\rm{Idm}}(R) ={\rm{Idm}}(R[x;\alpha, \delta])$, then $R$ is left McCoy. (ii) Every reduced left IN-ring with finitely many minimal prime ideals is a semiprime left Goldie ring. (iii) If $R$ is a commutative principal ideal ring, then $R$ and $R[x]$ are IN. (iv) If $R$ is a reduced ring and $n$ is a positive integer, then $R$ is right SA if and only if $R[x]/(x^{n+1})$ is right SA.- 27 June 2024
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 53 (3) , 704-713
On sum annihilator ideals in Ore extensions
A ring $R$ is called a left Ikeda-Nakayama ring (left IN-ring) if the right annihilator of the intersection of any two left ideals is the sum of the two right annihilators. As a generalization of left IN-rings, a ring $R$ is called a right SA-ring if the sum of right annihilators of two ideals is a right annihilator of an ideal of $R$. It would be interesting to find conditions under which an Ore extension $R[x; \alpha, \delta]$ is IN and SA. In this paper, we will present some necessary and sufficient conditions for the Ore extension $R[x;\alpha, \delta]$ to be left IN or right SA. In addition, for an $(\alpha,\delta)$-compatible ring $R$, it is shown that: (i) If $S = R[x;\alpha,\delta]$ is a left IN-ring with ${\rm{Idm}}(R) ={\rm{Idm}}(R[x;\alpha, \delta])$, then $R$ is left McCoy. (ii) Every reduced left IN-ring with finitely many minimal prime ideals is a semiprime left Goldie ring. (iii) If $R$ is a commutative principal ideal ring, then $R$ and $R[x]$ are IN. (iv) If $R$ is a reduced ring and $n$ is a positive integer, then $R$ is right SA if and only if $R[x]/(x^{n+1})$ is right SA.- Open Access
- 10 April 2023
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 10 (2) , 73-86
Some upper and lower bounds for $D_{\alpha}$-energy of graphs
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as $D_{\alpha}(G)=\alpha Tr(G)+(1-\alpha)D(G), ~~~~ 0\leq \alpha\leq 1$. Here, $D(G)$ is the distance matrix and $Tr(G)$ represents the vertex transmissions. Let $\partial_{1}\geq \partial_{2}\geq \cdots \geq \partial_{n}$ be the eigenvalues of $D_{\alpha}(G)$ and let $W(G)$ be the Wiener index. The generalizeddistance energy of $G$ can be defined as $E^{D_{\alpha}}(G)=\displaystyle\sum_{i=1}^{n}\left|\partial_i-\frac{2\alpha W(G)}{n}\right|$. In this paper, we develop some new theory regarding the generalized distance energy $E^{D_{\alpha}}(G)$ for a connected graph $G$. We obtain some sharp upper and lower bounds for$E^{D_{\alpha}}(G)$ connecting a wide range of parameters in graph theory including the maximum degree $\Delta$, the Wiener index $W(G)$, the diameter $d$, the transmission degrees, and the generalized distance spectral spread $D_{\alpha}S(G)$. We characterized the special graph classes that attain the bounds.- 10 April 2023
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 10 (2) , 73-86
Open AccessSome upper and lower bounds for $D_{\alpha}$-energy of graphs
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as $D_{\alpha}(G)=\alpha Tr(G)+(1-\alpha)D(G), ~~~~ 0\leq \alpha\leq 1$. Here, $D(G)$ is the distance matrix and $Tr(G)$ represents the vertex transmissions. Let $\partial_{1}\geq \partial_{2}\geq \cdots \geq \partial_{n}$ be the eigenvalues of $D_{\alpha}(G)$ and let $W(G)$ be the Wiener index. The generalizeddistance energy of $G$ can be defined as $E^{D_{\alpha}}(G)=\displaystyle\sum_{i=1}^{n}\left|\partial_i-\frac{2\alpha W(G)}{n}\right|$. In this paper, we develop some new theory regarding the generalized distance energy $E^{D_{\alpha}}(G)$ for a connected graph $G$. We obtain some sharp upper and lower bounds for$E^{D_{\alpha}}(G)$ connecting a wide range of parameters in graph theory including the maximum degree $\Delta$, the Wiener index $W(G)$, the diameter $d$, the transmission degrees, and the generalized distance spectral spread $D_{\alpha}S(G)$. We characterized the special graph classes that attain the bounds. - 9 January 2023
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 55 (1) , 298-309
Bounds for the spectral radius of the $A_{\alpha }$-matrix of graphs- 9 January 2023
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 55 (1) , 298-309
Bounds for the spectral radius of the $A_{\alpha }$-matrix of graphs- Open Access
Quantum Codes from additive constacyclic codes over a mixed alphabet and the MacWilliams identities
Let $\mathbb{Z}_p$ be the ring of integers modulo a prime number $p$ where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle u^2\rangle}$ and $\mathcal{S}=\frac{\mathbb{Z}_p[u]}{\langle u^3\rangle}$. We also study additive constacyclic codes over $\mathcal{R}\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S}$ using the generator polynomials over the rings $\mathcal{R}$ and $\mathcal{S},$ respectively. Further, by defining Gray maps on $\mathcal{R}$, $\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S},$ we obtain some results on the Gray images of additive codes. Then we give the weight enumeration and MacWilliams identities corresponding to the additive codes over $\mathbb{Z}_p\mathcal{R}\mathcal{S}$. Finally, as an application of the obtained codes, we give quantum codes using the CSS construction.Open AccessQuantum Codes from additive constacyclic codes over a mixed alphabet and the MacWilliams identities
Let $\mathbb{Z}_p$ be the ring of integers modulo a prime number $p$ where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle u^2\rangle}$ and $\mathcal{S}=\frac{\mathbb{Z}_p[u]}{\langle u^3\rangle}$. We also study additive constacyclic codes over $\mathcal{R}\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S}$ using the generator polynomials over the rings $\mathcal{R}$ and $\mathcal{S},$ respectively. Further, by defining Gray maps on $\mathcal{R}$, $\mathcal{S}$ and $\mathbb{Z}_p\mathcal{R}\mathcal{S},$ we obtain some results on the Gray images of additive codes. Then we give the weight enumeration and MacWilliams identities corresponding to the additive codes over $\mathbb{Z}_p\mathcal{R}\mathcal{S}$. Finally, as an application of the obtained codes, we give quantum codes using the CSS construction. - 5 October 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 23 (1) , #P1.06
On the Aα-spectral radius of connected graphs
For a simple graph G, the generalized adjacency matrix Aα(G) is defined as Aα(G) = αD(G) + (1−α)A(G), α ∈ [0,1], where A(G) is the adjacency matrix and D(G) is the diagonal matrix of the vertex degrees. It is clear that A0(G) = A(G) and 2A1/2(G) = Q(G) implying that the matrix Aα(G) is a generalization of the adjacency matrix and the signless Laplacian matrix. In this paper, we obtain some new upper and lower bounds for the generalized adjacency spectral radius λ(Aα(G)), in terms of vertex degrees, average vertex 2-degrees, the order, the size, etc. The extremal graphs attaining these bounds are characterized. We will show that our bounds are better than some of the already known bounds for some classes of graphs. We derive a general upper bound for λ(Aα(G)), in terms of vertex degrees and positive real numbers bi. As application, we obtain some new upper bounds for λ(Aα(G)). Further, we obtain some relations between clique number ω(G), independence number γ(G) and the generalized adjacency eigenvalues of a graph G.
- 5 October 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 23 (1) , #P1.06
On the Aα-spectral radius of connected graphs
For a simple graph G, the generalized adjacency matrix Aα(G) is defined as Aα(G) = αD(G) + (1−α)A(G), α ∈ [0,1], where A(G) is the adjacency matrix and D(G) is the diagonal matrix of the vertex degrees. It is clear that A0(G) = A(G) and 2A1/2(G) = Q(G) implying that the matrix Aα(G) is a generalization of the adjacency matrix and the signless Laplacian matrix. In this paper, we obtain some new upper and lower bounds for the generalized adjacency spectral radius λ(Aα(G)), in terms of vertex degrees, average vertex 2-degrees, the order, the size, etc. The extremal graphs attaining these bounds are characterized. We will show that our bounds are better than some of the already known bounds for some classes of graphs. We derive a general upper bound for λ(Aα(G)), in terms of vertex degrees and positive real numbers bi. As application, we obtain some new upper bounds for λ(Aα(G)). Further, we obtain some relations between clique number ω(G), independence number γ(G) and the generalized adjacency eigenvalues of a graph G.