Maryam Baghipur

Ms. Maryam Baghipur

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
3 June 2018 in Discrete Mathematics, Algorithms and Applications
Verified
Journal Article
Closed access
PDF file
AAAbdollah Alhevaz
Abdollah Alhevaz
MBMaryam Baghipur
Maryam Baghipur
SPSomnath Paul
Somnath Paul

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 March 2018 in Bulletin of the Malaysian Mathematical Sciences Society
Verified
Journal Article
Closed access
PDF file
AAAbdollah Alhevaz
Abdollah Alhevaz
MBMaryam Baghipur
Maryam Baghipur
EHE. Hashemi
E. Hashemi
HRH. S. Ramane
H. S. Ramane

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.

19 December 2019 in Mathematics
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
The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

6 September 2020 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
Shariefuddin PirzadaShariefuddin Pirzada
Shariefuddin Pirzada
HGH. A. Ganie
H. A. Ganie
AAAbdollah Alhevaz
Abdollah Alhevaz
MBMaryam Baghipur
Maryam Baghipur
For a simple connected graph G, let D(G), Tr(G), DL(G) and DQ(G), respectively, are the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix. The generalized distance matrix Dα(G) of G is the convex linear combinations of Tr(G) and D(G) and is defined as Dα(G)=αTr(G)+(1−α)D(G), for 0≤α≤1. As D0(G)=D(G),  2D12(G)=DQ(G),   D1(G)=Tr(G) and Dα(G)−Dβ(G)=(α−β)DL(G), this matrix reduces to merging the distance spectral and distance signless Laplacian spectral theories. Let ∂1(G)≥∂2(G)≥⋯≥∂n(G) be the eigenvalues of Dα(G) and let SDα(G)=∂1(G)−∂n(G) be the generalized distance spectral spread of the graph G. In this paper, we obtain bounds for the generalized distance spectral spread SDα(G). We also obtain a relation between the generalized distance spectral spread SDα(G) and the distance spectral spread SD(G). Further, we obtain lower bounds for SDα(G) of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for SDα(G) in terms of clique number and independence number of the graph G and characterize the extremal graphs for some cases.