Abstract
The non-uniform hypergraph is the general hypergraph in which an edge can join any number of vertices. This makes them more applicable data structure than the uniform hypergraph and also, on the other hand, mathematical relations of the nonuniform hypergraph are usually complicated. In this paper, we study the non-uniform hypergraph more precisely and then analyze some of its spectral properties and compare them with those of the uniform hypergraph.
Sign-in/Register to access full text options 
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.
