Generalized Group–Subgroup Pair Graphs [chapter]

Kazufumi Kimoto
2020 Mathematics for Industry  
A regular finite graph is called a Ramanujan graph if its zeta function satisfies an analog of the Riemann Hypothesis. Such a graph has a small second eigenvalue so that it is used to construct cryptographic hash functions. Typically, explicit family of Ramanujan graphs are constructed by using Cayley graphs. In the paper, we introduce a generalization of Cayley graphs called generalized group–subgroup pair graphs, which are a generalization of group–subgroup pair graphs defined by
more » ... We study basic properties, especially spectra of them.
doi:10.1007/978-981-15-5191-8_14 fatcat:m457e5dmzbhabibba47a64drku