Results 11 to 20 of about 29,528 (258)
Upper and Lower Bounds for the Spectral Radius of Generalized Reciprocal Distance Matrix of a Graph [PDF]
Mathematics, 2022 For a connected graph G on n vertices, recall that the reciprocal distance signless Laplacian matrix of G is defined to be RQ(G)=RT(G)+RD(G), where RD(G) is the reciprocal distance matrix, RT(G)=diag(RT1,RT2,⋯,RTn) and RTi is the reciprocal distance ...
Yuzheng Ma, Yubin Gao, Yanling Shao
doaj +2 more sources
A note on distance spectral radius of trees
Special Matrices, 2017 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
Wang Yanna +3 more
doaj +2 more sources
The Distance Laplacian Spectral Radius of Clique Trees [PDF]
Discrete Dynamics in Nature and Society, 2020 The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distance matrix of G and TrG is the diagonal matrix of vertex transmissions of G.
Xiaoling Zhang, Jiajia Zhou
doaj +2 more sources
On spectral radius of the generalized distance matrix of a graph [PDF]
Discrete Mathematics Letters, 2021 Shariefuddin Pirzada
doaj +2 more sources
On the spectral radius and energy of the degree distance matrix of a connected graph [PDF]
Open MathematicsLet GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +2 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +1 more source
On the General Sum Distance Spectra of Digraphs
Mathematics, 2023 Let G be a strongly connected digraph, and dG(vi,vj) denote the distance from the vertex vi to vertex vj and be defined as the length of the shortest directed path from vi to vj in G.
Weige Xi +3 more
doaj +1 more source
Experimental realization of a Fresnel hologram as a super spectral resolution optical element
Scientific Reports, 2021 A highly dispersive, diffractive optical element is designed and realized for an extremely high spectral resolution spectroscopy for exoplanet telescope application.
Mei-Li Hsieh +5 more
doaj +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