Results 21 to 30 of about 33,403 (178)

A Lower Bound for the Distance Laplacian Spectral Radius of Bipartite Graphs with Given Diameter

Mathematics, 2022
Let G be a connected, undirected and simple graph. The distance Laplacian matrix L(G) is defined as L(G)=diag(Tr)−D(G), where D(G) denotes the distance matrix of G and diag(Tr) denotes a diagonal matrix of the vertex transmissions.
Linming Qi, Lianying Miao, Weiliang Zhao, Lu Liu   +3 more
doaj   +2 more sources

The distance spectral radius of digraphs

Discrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqiu Lin, Jinlong Shu
exaly   +2 more sources

Radial oscillation of an encapsulated bubble near a planar rigid wall under dual-frequency acoustic excitation in viscoelastic fluids [PDF]

Ultrasonics Sonochemistry
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 ...
Yu-Chen Zang, Di-Chao Chen, Xing-Feng Zhu, Da-Jian Wu, Wei-Jun Lin   +4 more
doaj   +2 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.
Xiaoling Zhang, Chris Godsil
exaly   +3 more sources

Bounds for resistance-distance spectral radius

, 2013
Lower and upper bounds as well as Nordhause-Gaddum-type results for the resistance-distance spectral radius are obtained.
Maden, A. Dilek Gungor, Gutman, Ivan, Cevik, A. Sinan   +2 more
core   +6 more sources

Upper and Lower Bounds for the Spectral Radius of Generalized Reciprocal Distance Matrix of a Graph

Mathematics, 2022
For a connected graph G on n vertices, recall that the reciprocal distance signless Laplacian matrix of G is defined to be RQ(G)=RT(G)+RD(G), where RD(G) is the reciprocal distance matrix, RT(G)=diag(RT1,RT2,⋯,RTn) and RTi is the reciprocal distance ...
Yuzheng Ma, Yubin Gao, Yanling Shao
doaj   +2 more sources

Matching extension and distance spectral radius [PDF]

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   +4 more sources

On the distance Laplacian spectral radius of bipartite graphs

Discrete Applied Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aihong Niu, Dandan Fan, Guoping Wang
exaly   +2 more sources

On the distance spectral radius of some graphs

Linear Algebra and its Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Xiaoling
openaire   +2 more sources

On the distance spectral radius of bipartite graphs

Linear Algebra and its Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nath, Milan, Paul, Somnath
openaire   +2 more sources