Results 21 to 30 of about 440,939 (238)
Distance spectral radius of series-reduced trees with parameters [PDF]
RAIRO Oper. Res., 2020 For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G.
Yuyuan Deng +3 more
openalex +2 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
Toughness and distance spectral radius in graphs involving minimum degree [PDF]
Discrete Applied Mathematics, 2023 Jing Lou, Ruifang Liu, Jinlong Shu
openalex +3 more sources
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 +3 more sources
On the generalized distance spectral radius of graphs [PDF]
, 2019 The generalized distance spectral radius of a connected graph $G$ is the spectral radius of the generalized distance matrix of $G$, defined by $$D_α(G)=αTr(G)+(1-α)D(G), \;\;0\leα\le 1,$$ where $D(G)$ and $Tr(G)$ denote the distance matrix and diagonal matrix of the vertex transmissions of $G$, respectively.
Shu‐Yu Cui, Gui‐Xian Tian, Lu Zheng
openalex +3 more sources
On spectral radius of the distance matrix
Applicable Analysis and Discrete Mathematics, 2010 We characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with n vertices: with fixed vertex connectivity, matching number and chromatic number, respectively.
Zhongzhu Liu
openalex +4 more sources
Sharp bounds on distance spectral radius of graphs [PDF]
Linear and Multilinear Algebra, 2012 Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ϱ(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible.
Huiqiu Lin, Jinlong Shu
openalex +2 more sources
The spectral radius and the distance spectral radius of complements of block graphs [PDF]
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius attain minimum and maximum among all complements of block graphs, respectively.
Xu Chen +3 more
openalex +3 more sources
The distance Laplacian spectral radius of unicyclic graphs [PDF]
, 2017 11 ...
Hongying Lin, Bo Zhou
openalex +3 more sources
On distance spectral radius of uniform hypergraphs with cycles
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou
openaire +3 more sources