Results 201 to 210 of about 440,939 (238)
Some of the next articles are maybe not open access.
On the distance Laplacian spectral radius of bicyclic graphs
Linear and Multilinear Algebra, 2021The distance Laplacian matrix of a connected graph G is defined as L(G)=Tr(G)−D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G.
Nannan Xu, Aimei Yu, Rong-Xia Hao
openaire +1 more source
On the distance spectral radius of digraphs with given diameter
Linear and multilinear algebra, 2019The distance spectral radius of a strongly connected digraph G is the eigenvalue of its distance matrix with the largest modulus. Let denote the set of strongly connected digraphs with order n and diameter d.
Weige Xi, W. So, Ligong Wang
semanticscholar +1 more source
An Aα-spectral radius for a spanning tree with constrained leaf distance in a graph
FilomatLet ? ? [0, 1) be a real number, and let G be a connected graph of order n with n ? ?(?), where ?(?) = 9 for 0 ? ? ? 2/3 and ?(?) = 4/1?? for 2/3 < ? < 1. A spanning tree T of G is a subgraph of G that is a tree covers all vertices of G.
Su Wang, Wei Zhang
semanticscholar +1 more source
A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
Discrete Mathematics, Algorithms and Applications, 2014We characterize graphs with minimal distance spectral radius in two classes of graphs: with vertex connectivity k and minimum degree at least k, and with given number of blocks. Moreover, we determine the unique graph that maximizes the distance spectral radius among all graphs with given clique number.
Nath, Milan, Paul, Somnath
openaire +2 more sources
On the distance spectral radius and the distance energy of graphs
Linear and Multilinear Algebra, 2011The D-eigenvalues {μ1, μ2, … , μ p } of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E D (G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E D (G) which improve Indulal's bounds [G ...
Gungor, A. Dilek, Bozkurt, S. Burca
openaire +2 more sources
Bounds for Resistance–Distance Spectral Radius
2014Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.
MADEN, A. Dilek Güngör +2 more
openaire +1 more source
Minimizing the distance spectral radius of uniform hypertrees with given parameters
Computational and Applied Mathematics, 2023Chengli Li, Bo Zhou
semanticscholar +1 more source
On distance spectral radius of graphs with given number of pendant paths of fixed length
Aequationes Mathematicae, 2022Yanna Wang, Bo Zhou
semanticscholar +1 more source
Semitransparent organic photovoltaics for building-integrated photovoltaic applications
Nature Reviews Materials, 2022Yongxi Li
exaly
On distance spectral radius of books
Computational and Applied MathematicsHongying Lin
semanticscholar +1 more source