Answers are grounded in this paper and cite their sources.
Let G be a connected graph and let k ≥ 2 be an integer. A spanning tree with maximum degree at most k is called a spanning k-tree. As a generalization of the above concept, the concept of total excess is defined as follows: for a spanning subgraph H of a connected graph G and an integer t, the total t-excess te(H,t) is defined by te(H,t) = X max{0,dH(v) − t}, v∈V(H) where dH(v) is the degree of v in H. It is easy to see that for a spanning tree T, T is a spanning k-tree if and only if te(T,t) = 0. Let e(G) and ρa(G) denote the size and the Aa-spectral radius of G, respectively. In this work, we put forward two sufficient conditions for a connected graph G containing a spanning tree T with te(T,k) ≤ k − 3 via the size or the Aa-spectral radius.
No takes yet. Share an insight, caveat, or question.
Sufang Wang (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: