The distance spectral radius of k-uniform hypertrees with given number of vertices of maximum degree
Abstract
This paper investigates the influence of two graft transformations on the distance spectral radius of connected uniform hypergraphs. Specifically, we study k-uniform hypertrees with given size, maximum degree and number of vertices of maximum degree, and give the structure of such hypergraph with maximum distance spectral radius.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.