Results 11 to 20 of about 339,685 (278)
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 +3 more sources
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
Discussiones Mathematicae Graph Theory, 2014 The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +3 more sources
Connectivity and minimal distance spectral radius of graphs [PDF]
Linear and Multilinear Algebra, 2011 In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance spectral radius.
Zhang, Xiaoling, Godsil, Chris
openaire +4 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 +3 more sources
The distance spectral radius of digraphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Shu, Jinlong
openaire +3 more sources
Distance spectral radius of digraphs with given connectivity
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu +3 more
openaire +4 more sources
Distance spectral radius of trees with given matching number
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic
openaire +4 more sources
Spanning k-trees and distance spectral radius in graphs
The Journal of Supercomputing11 ...
Zhou, Sizhong, Wu, Jiancheng
openaire +4 more sources
Matching extension and distance spectral radius
Linear Algebra and its Applications, 2023 A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the $k ...
Yuke Zhang, Edwin R. van Dam
openaire +3 more sources
Shock and Vibration, 2022 In this study, the effect of urban subway tunnels with a circular cross section on the spectral velocity of the ground surface in alluvial soils was investigated.
Hamed Fakhriyeh +2 more
doaj +1 more source