Results 1 to 10 of about 338,364 (169)
On the distance α-spectral radius of a connected graph [PDF]
Journal of Inequalities and Applications, 2020 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]
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
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]
Mathematics, 2020 In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph.
Luis Medina, Hans Nina, Macarena Trigo
doaj +2 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
Radial oscillation of an encapsulated bubble near a planar rigid wall under dual-frequency acoustic excitation in viscoelastic fluids [PDF]
Ultrasonics SonochemistryMicrobubbles 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 ...
Yu-Chen Zang +4 more
doaj +2 more sources
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 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 +3 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
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]
Journal of Algebraic Systems, 2021 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 $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj +1 more source
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
Karpatsʹkì Matematičnì Publìkacìï, 2022 If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj +1 more source