Photo by kattrinnaaaaa from unsplash
In this study we consider connected signed graphs with 2 eigenvalues that admit a vertex set partition such that the induced signed graphs also have 2 eigenvalues, each. We derive… Click to show full abstract
In this study we consider connected signed graphs with 2 eigenvalues that admit a vertex set partition such that the induced signed graphs also have 2 eigenvalues, each. We derive some spectral characterizations, along with examples supported by additional theoretical results. We also prove an inequality that is a fundamental ingredient for the resolution of the Sensitivity Conjecture.
Keywords:
signed graphs;
two eigenvalues;
decomposition signed;
graphs two
Journal Title: Filomat
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Filomat
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!