Abstract
In this paper, the adjacency tensor of a general hypergraph is investigated. We study the Perron–Frobenius theorem for the general hypergraphs and obtain some relevant results based on it. In particular, the techniques of weighted incidence matrix and moving edge are extended to general hypergraphs for determining the structure with the maximum spectral radius. A nearly m-uniform supertree is both connected and acyclic, in which each edge contains either m−1 or m vertices. To begin with, the structures obtaining the maximum spectral radius in two classes of nearly uniform supertrees are determined, where one class is with given number of edges and the other is with given number of vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
