Maryam Baghipur
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
Maryam Baghipur has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Abdollah Alhevaz
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
15 shared publications - Yilun Shang
School of Computer Science, Northumbria University, Newcastle upon Tyne, NE1 8ST, UK
11 shared publications - Shariefudddin Pirzada
Department of Mathematics, University of Kashmir, Srinagar, India
8 shared publications - Harishchandra S. Ramane
Department of Mathematics, Karnatak University, Dharwad, India
4 shared publications - Modjtaba Ghorbani
Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran
4 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. - 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (02)
Relation between generalized distance spread and some topological indices
Let [ ] be a connected graph. The generalized distance matrix is defined as [ ], where [ ], [ ] is the distance matrix whose [ ]th entry is the distance between the [ ]th and [ ]th vertices in [ ] and [ ] is the diagonal matrix where each nonzero entry corresponds to the total distance to a vertex. The generalized distance spread, [ ] was defined as the difference between the largest eigenvalue and the smallest eigenvalue of [ ]. In this paper some lower bounds for [ ] in terms of [ ], the Wiener index and [ ] is presented and the equality cases are discussed. For a graph with prescribed diameter, a lower bound for [ ] as function of the vertex transmissions, distances between vertices, the diameter and [ ] is presented. A lower bound for this graph invariant in the class of trees is given. Additionally, lower bounds for [ ] as function of some known topological indices are presented. Some closed formulas for [ ] of known vertex-transitive graphs such as the polyhex nanotorus and hypercube are presented as applications of previous results. Moreover, some lower bounds (as function of [ ]) for some known molecular graphs are also presented.
- 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (02)
Relation between generalized distance spread and some topological indices
Let [ ] be a connected graph. The generalized distance matrix is defined as [ ], where [ ], [ ] is the distance matrix whose [ ]th entry is the distance between the [ ]th and [ ]th vertices in [ ] and [ ] is the diagonal matrix where each nonzero entry corresponds to the total distance to a vertex. The generalized distance spread, [ ] was defined as the difference between the largest eigenvalue and the smallest eigenvalue of [ ]. In this paper some lower bounds for [ ] in terms of [ ], the Wiener index and [ ] is presented and the equality cases are discussed. For a graph with prescribed diameter, a lower bound for [ ] as function of the vertex transmissions, distances between vertices, the diameter and [ ] is presented. A lower bound for this graph invariant in the class of trees is given. Additionally, lower bounds for [ ] as function of some known topological indices are presented. Some closed formulas for [ ] of known vertex-transitive graphs such as the polyhex nanotorus and hypercube are presented as applications of previous results. Moreover, some lower bounds (as function of [ ]) for some known molecular graphs are also presented.
- 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.
- 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. - Open Access
- 15 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1416
On the Generalized Adjacency Spread of a Graph
For a simple finite graph G, the generalized adjacency matrix is defined as , where and are respectively the adjacency matrix and diagonal matrix of the vertex degrees. The -spread of a graph G is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the . In this paper, we answer the question posed in (Lin, Z.; Miao, L.; Guo, S. Bounds on the -spread of a graph. Electron. J. Linear Algebra 2020, 36, 214–227). Furthermore, we show that the path graph, , has the smallest among all trees of order n. We establish a relationship between and We obtain several bounds for .- 15 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1416
Open AccessOn the Generalized Adjacency Spread of a Graph
For a simple finite graph G, the generalized adjacency matrix is defined as , where and are respectively the adjacency matrix and diagonal matrix of the vertex degrees. The -spread of a graph G is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the . In this paper, we answer the question posed in (Lin, Z.; Miao, L.; Guo, S. Bounds on the -spread of a graph. Electron. J. Linear Algebra 2020, 36, 214–227). Furthermore, we show that the path graph, , has the smallest among all trees of order n. We establish a relationship between and We obtain several bounds for . - 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- 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.
- 20 June 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (5) , 1-15
On the eigenvalues and spread of the generalized distance matrix of a graph
- 20 June 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (5) , 1-15
On the eigenvalues and spread of the generalized distance matrix of a graph