Spanning k-trees and distance spectral radius in graphs

arXiv2304.08846MaRDI QIDQ6433472FDOQ6433472

Authors: Sizhong Zhou, Jiancheng Wu 

Publication date: 18 April 2023

Abstract: Let $kgeq2$ be an integer. A tree $T$ is called a $k$-tree if $d_T(v)leqk$ for each $vinV(T)$, that is, the maximum degree of a $k$-tree is at most $k$. Let $lambd{a}_1(D(G))$ denote the distance spectral radius in $G$, where $D(G)$ denotes the distance matrix of $G$. In this paper, we verify a upper bound for $lambd{a}_1(D(G))$ in a connected graph $G$ to guarantee the existence of a spanning $k$-tree in $G$.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Spanning k-trees and distance spectral radius in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433472)