Distance spectral radius of uniform hypergraphs
Hongying Lin, Bo Zhou
TL;DR
This paper investigates how specific graft transformations affect the distance spectral radius of uniform hypergraphs and identifies extremal hypertrees with respect to this spectral property.
Contribution
It introduces and analyzes three graft transformations and determines the unique extremal hypertrees for maximum and minimum distance spectral radius.
Findings
Identified the hypertrees with maximum and minimum distance spectral radius.
Analyzed the impact of graft transformations on spectral radius.
Provided a characterization of extremal uniform hypertrees.
Abstract
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 -uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Gene expression and cancer classification · Tensor decomposition and applications