Results 41 to 50 of about 33,403 (178)
A sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
, 2016 summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance ...
Shu, Yujie, Zhang, Xiao-Dong, You, Lihua
core +1 more source
On the distance energy of k-uniform hypergraphs
Special Matrices, 2023 In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +1 more source
On distance spectral radius of graphs
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yanna, Zhou, Bo
openaire +1 more source
A proof of a conjecture on the distance spectral radius
Linear Algebra and its Applications, 2023 A cactus is a connected graph in which any two cycles have at most one common vertex. We determine the unique graph that maximizes the distance spectral radius over all cacti with fixed numbers of vertices and cycles, and thus prove a conjecture on the distance spectral radius of cacti in [S.S. Bose, M. Nath, S. Paul, On the distance spectral radius of
Yanna Wang, Bo Zhou
openaire +3 more sources
Photonics, 2021 Partially coherent optical vortices have been applicated widely to reduce the influence of atmospheric turbulence, especially for free-space optical (FSO) communication.
Jiao Wang +5 more
doaj +1 more source
k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj +1 more source
Mathematics, 2022 This study focuses on tensor Z-eigenvalue localization and its application in the geometric measure of entanglement for multipartite quantum states. A new Z-eigenvalue localization theorem and the bounds for the Z-spectral radius are derived, which are ...
Liang Xiong +3 more
doaj +1 more source
Distance spectral radius of series-reduced trees with parameters
, 2021 For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G.
Dangui Li +3 more
core +1 more source
On distance signless Laplacian spectrum and energy of graphs
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 +1 more source