Photo by gavinbiesheuvel from unsplash
This paper computes eigenvalues of discrete complete hypergraphs and partitioned hypergraphs. We define positive equivalence relation on hypergraphs that establishes a connection between hypergraphs and graphs. With this regards it… Click to show full abstract
This paper computes eigenvalues of discrete complete hypergraphs and partitioned hypergraphs. We define positive equivalence relation on hypergraphs that establishes a connection between hypergraphs and graphs. With this regards it makes a connection between spectrum of graphs and spectrum of quotient of any hypergraphs. Finally, this study tries to construct spectrum of path trees via quotient of partitioned hypergraphs.
Keywords:
spectrum graphs;
graphs;
hypergraphs;
accessible spectrum
Journal Title: Applicable Analysis and Discrete Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Applicable Analysis and Discrete Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!