Abstract
We study the spectra of cyclic signatures of finite graphs and the corresponding cyclic lifts. Starting from a bipartite Ramanujan graph, we prove the existence of an infinite tower of 3-cyclic lifts, each of which is again Ramanujan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. P. Abelson and M. J. Rosenberg, Symbolic psycho-logic: A model of attitudinal cognition, Behavioral Sci. 3 (1958), 1–13.
N. Agarwal, A. Kolla, V. Madan, Small lifts of expander graphs are expanding, arXiv: 1311.3268v1, November 2013.
A. Amit, N. Linial, Random graph coverings I: General theory and graph connectivity, Combinatorica 22 (2002), no. 1, 1–18.
F. M. Atay, S. Liu, Cheeger constants, structural balance, and spectral clustering analysis for signed graphs, Discrete Math. 343 (2020), no. 1, 111616, 26 pp.
Y. Bilu, N. Linial, Lifts, discrepancy and nearly optimal spectral gap, Combinatorica 26 (2006), no. 5, 495–519.
D. Cartwright, F. Harary, Structural balance: a generalization of Heider’s theory, Psychol. Rev. 63 (1956), no. 5, 277–293.
K. Chandrasekaran, A. Velingker, Shift lifts preserving Ramanujan property, Linear Algebra and its Applications 529 (2017), 199–214.
J. Friedman, Relative expanders or weakly relatively Ramanujan graphs, Duke Math. J. 118 (2003), no. 1, 19–35.
C. D. Godsil, Matchings and walks in graphs, J. Graph Theory 5 (1981), no. 3, 285–297.
C. D. Godsil, I. Gutman, On the matching polynomial of a graph, Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), pp. 241–249, Colloq. Math. Soc. János Bolyai, 25, North-Holland, Amsterdam-New York, 1981.
J. L. Gross, Voltage graphs, Discrete Math. 9 (1974), 239–246.
J. L. Gross, S. R. Alpert, Branched coverings of graph imbeddings, Bull. Amer. Math. Soc. 79 (1973), 942–945.
J. L. Gross, S. R. Alpert, The topological theory of current graphs, J. Combinatorial Theory Ser. B 17 (1974), 218–233.
J. L. Gross, T. W. Tucker, Quotients of complete graphs: revisiting the Heawood map-coloring problem, Pacific J. Math. 55 (1974), 391–402.
J. L. Gross, T. W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977), no. 3, 273–283.
W. Gustin, Orientable embedding of Cayley graphs, Bull. Amer. Math. Soc. 69 (1963), 272–275.
C. Hall, D. Puder, W. F. Sawin, Ramanujan coverings of graphs, Adv. Math. 323 (2018), 367–410.
F. Harary, On the notion of balance of a signed graph, Michigan Math. J. 2 (1953), no. 2, 143–146.
F. Harary, Structural duality, Behavioral Sci. 2 (1957), no. 4, 255–265.
F. Harary, On the measurement of structural balance, Behavioral Sci. 4 (1959), 316–323.
P. J. Heawood, Map colour theorem, Quart. J. Math. Oxford Ser. 2 24 (1890), 332–338.
O. J. Heilmann, E. H. Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), 190–232.
S. Hoory, N. Linial, A. Wigderson, Expander graphs and their applications, Bull. Amer. Math. Soc. 43 (2006), no. 4, 439–561.
C. Lange, S. Liu, N. Peyerimhoff, O. Post, Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians, Calc. Var. Partial Differential Equations 54 (2015), no. 4, pp. 4165–4196.
A. W. Marcus, D. A. Spielman, N. Srivastava, Interlacing families I: Bipartite Ramanujan graphs of all degrees, Proceedings of FOCS, 529–537, 2013; Ann. of Math. (2) 182 (2015), no. 1, 307–325.
A. W. Marcus, D. A. Spielman, N. Srivastava, Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer Problem, Ann. of Math. (2) 182 (2015), no. 1, 327–350.
A. W. Marcus, D. A. Spielman, N. Srivastava, Ramanujan graphs and the solution of the Kadison-Singer problem, Proceedings of the International Congress of Mathematicians-Seoul 2014. Vol. III, 363–386, Kyung Moon Sa, Seoul, 2014.
D. Puder, Expansion of random graphs: new proofs, new results, Invent. Math. 201 (2015), no. 3, 845–908.
G. Ringel, Map color theorem, Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Band 209, Springer-Verlag, New York-Heidelberg, 1974.
G. Ringel, J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. U.S.A. 60 (1968), 438–445.
M. A. Shubin, Discrete magnetic Laplacian, Comm. Math. Phys. 164 (1994), no. 2, 259–275.
T. Sunada, A discrete analogue of periodic magnetic Schrödinger operators, Geometry of the spectrum (Seattle, WA, 1993), 283–299, Contemp. Math., 173, Amer. Math. Soc., Providence, RI, 1994.
J. W. T. Youngs, The Heawood Map Coloring Conjecture, Chapter 12 in Graph Theory and Theoretical Physics (F. Harary, ed.), pp. 313–354, Academic Press, London, 1967.
T. Zaslavsky, Signed graphs, Discrete Appl. Math. 4 (1982), no. 1, 47–74.
T. Zaslavsky, Matrices in the theory of signed simple graphs, Advances in discrete mathematics and applications: Mysore, 2008, 207–229, Ramanujan Math. Soc. Lect. Notes Ser., 13, Ramanujan Math. Soc., Mysore, 2010.
Acknowledgements
We thank Stefan Dantchev for bringing the reference [2] to our attention. We acknowledge the support of the EPSRC Grant EP/K016687/1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Liu, S., Peyerimhoff, N., Vdovina, A. (2020). Signatures, Lifts, and Eigenvalues of Graphs. In: Atay, F., Kurasov, P., Mugnolo, D. (eds) Discrete and Continuous Models in the Theory of Networks. Operator Theory: Advances and Applications, vol 281. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-44097-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-44097-8_13
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-44096-1
Online ISBN: 978-3-030-44097-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)