Results 1 to 10 of about 81 (63)
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 +5 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 +4 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
Ain Shams Engineering JournalIn 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 +4 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
Sharp Bounds on (Generalized) Distance Energy of Graphs [PDF]
Mathematics, 2020 Given a simple connected graph G, let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian matrix, D Q ( G ) be the distance signless Laplacian matrix, and T r ( G ) be the vertex transmission ...
Abdollah Alhevaz +3 more
doaj +2 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}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +2 more sources
On Distance Signless Laplacian Estrada Index and Energy of Graphs [PDF]
Kragujevac Journal of Mathematics, 2021 Summary: For a connected graph \(G\), the distance signless Laplacian matrix is defined as \(D^Q(G)=\mathrm{Tr}(G)+D(G)\), where \(D(G)\) is the distance matrix of \(G\) and \(\mathrm{Tr}(G)\) is the diagonal matrix of vertex transmissions of \(G\).
Alhevaz, Abdolla +2 more
openaire +1 more source
On graphs with minimal distance signless Laplacian energy [PDF]
Acta Universitatis Sapientiae, Mathematica, 2021 Abstract For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ
Pirzada S. +3 more
openaire +3 more sources
Minimum covering reciprocal distance signless Laplacian energy of graphs
Acta Universitatis Sapientiae, Informatica, 2018 Abstract Let G be a simple connected graph. The reciprocal transmission Tr′G(ν) of a vertex ν is defined as
Alhevaz Abdollah +3 more
openaire +2 more sources