Photo from archive.org
Abstract We investigate the problem of finding all the biregular graphs with just three adjacency eigenvalues, one of which is an eigenvalue ≠ − 1 , 0 of maximal possible… Click to show full abstract
Abstract We investigate the problem of finding all the biregular graphs with just three adjacency eigenvalues, one of which is an eigenvalue ≠ − 1 , 0 of maximal possible multiplicity.
Keywords:
graphs three;
concerning graphs;
distinct eigenvalues;
problem concerning;
three distinct;
problem
Journal Title: Linear Algebra and its Applications
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!