Results 1 to 10 of about 33,953 (153)
On the distance α-spectral radius of a connected graph [PDF]
For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +3 more sources
The Distance Laplacian Spectral Radius of Clique Trees [PDF]
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
On the Distance Spectral Radius of Trees with Given Degree Sequence
We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +4 more sources
The distance spectral radius of digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqiu Lin, Jinlong Shu
exaly +2 more sources
A note on distance spectral radius of trees
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
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
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
Radial oscillation of an encapsulated bubble near a planar rigid wall under dual-frequency acoustic excitation in viscoelastic fluids. [PDF]
Microbubbles play an important role in acoustic cavitation, power ultrasonics, and biomedical diagnosis and therapy. However, the influence of surrounding boundary conditions on the dynamic behaviors of an encapsulated bubble requires more in depth ...
Zang YC, Chen DC, Zhu XF, Wu DJ, Lin WJ.
europepmc +2 more sources
Connectivity and minimal distance spectral radius of graphs [PDF]
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.
Chris Godsil, Xiaoling Zhang
exaly +3 more sources
Distance spectral radius of digraphs with given connectivity
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weihua Yang, Huiqiu Lin, Jinlong Shu
exaly +4 more sources
On the distance Laplacian spectral radius of bipartite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aihong Niu, Dandan Fan, Guoping Wang
exaly +2 more sources

