Results 11 to 20 of about 7,057,923 (115)
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]
Mathematics, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
doaj +6 more sources
On distance signless Laplacian spectrum and energy of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +6 more sources
Ain Shams Engineering Journal, 2023 In this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +5 more sources
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +3 more sources
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
MathematicsLet X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina +2 more
doaj +3 more sources
Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs [PDF]
Mathematics, 2019 Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz +2 more
doaj +4 more sources
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
Linear and Multilinear Algebra, 2021 In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph $ G_{n} $ Gn.
P. Naveen, A. Chithra
semanticscholar +4 more sources
On graphs with minimal distance signless Laplacian energy [PDF]
Acta Universitatis Sapientiae, Mathematica, 2021 For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ1Q≥ρ2Q≥⋯≥ρnQ \rho _1^Q \ge \rho _2^Q \ge \cdots \ge \rho _n^Q , the distance signless Laplacian energy DSLE(G) is defined as DSLE(G)=∑i=1n| ρiQ-2W(G)n | DSLE\left ...
S. Pirzada +3 more
semanticscholar +4 more sources
Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs [PDF]
Le Matematiche, 2019 Summary: In this paper, we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and obtain some bounds for the maximum eigenvalue of this matrix. We also focus on bipartite graphs and find some bounds for the spectral radius of the reciprocal distance signless Laplacian matrix of this class of graphs. Moreover,
A. Alhevaz, M. Baghipur, H.S. Ramane
core +3 more sources
On comparison between the distance energies of a connected graph [PDF]
HeliyonLet G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +2 more sources