Results 1 to 10 of about 440,939 (238)
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 +5 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 +4 more sources
ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
Bulletin of the Australian Mathematical Society, 2023 AbstractWe first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching.
Shuchao Li, Shujing Miao, Minjie Zhang
semanticscholar +4 more sources
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 +5 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 van Dam
semanticscholar +6 more sources
Spanning k-trees and distance spectral radius in graphs [PDF]
The Journal of Supercomputing, 2023 11 ...
Sizhong Zhou, Jian-Cheng Wu
semanticscholar +4 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 +3 more sources
Distance spectral radius and edge-disjoint spanning trees
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dandan Fan, Rumeng He, Yanhua Zhao
semanticscholar +5 more sources
Distance spectral radius of uniform hypergraphs [PDF]
Linear Algebra and its Applications, 2016 We study the effect of three types of graft transformations to increase or decrease the distance spectral radius of uniform hypergraphs, and we determined the unique $k$-uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.
Hongying Lin, Bo Zhou
semanticscholar +8 more sources
Maximal distance spectral radius of 4-chromatic planar graphs [PDF]
Linear Algebra and its Applications, 2021 We show that the kite graph $K_4^{(n)}$ uniquely maximizes the distance spectral radius among all connected $4$-chromatic planar graphs on $n$ vertices.
Aysel Erey
semanticscholar +6 more sources