Large regular bipartite graphs with median eigenvalue 1

@inproceedings{Guo2013LargeRB,
  title={Large regular bipartite graphs with median eigenvalue 1},
  author={Krystal Guo and B. Mohar},
  year={2013}
}
  • Krystal Guo, B. Mohar
  • Published 2013
  • Mathematics
  • A recent result of one of the authors says that every connected subcubic bipartite graph that is not isomorphic to the Heawood graph has at least one, and in fact a positive proportion of its eigenvalues in the interval [−1, 1]. We construct an infinite family of connected cubic bipartite graphs which have no eigenvalues in the open interval (−1, 1), thus showing that the interval [−1, 1] cannot be replaced by any smaller symmetric subinterval even when allowing any finite number of exceptions… CONTINUE READING
    4 Citations

    Figures from this paper

    Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
    • 8
    • PDF
    Median eigenvalues of bipartite graphs
    • 9
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Expander Graphs and their Applications
    • 1,496
    • PDF
    Random Walks on Infinite Graphs and Groups
    • 857
    • PDF
    lambda1, Isoperimetric inequalities for graphs, and superconcentrators
    • 631
    Introduction To The Baum-Connes Conjecture
    • 149
    • PDF
    A Survey on Spectra of infinite Graphs
    • 265
    • PDF
    The Creation of Spectral Gaps by Graph Decoration
    • 56
    • PDF
    Eigenvalues in Combinatorial Optimization
    • 158
    • PDF
    The spectrum of an infinite graph
    • 65
    Counterexamples to the Baum—Connes conjecture
    • 227
    • PDF
    HOMO-LUMO Maps for Fullerenes.
    • 29
    • PDF