Cayley-type graphs for group-subgroup pairs

From MaRDI portal
Publication:896858

DOI10.1016/J.LAA.2015.09.049zbMATH Open1326.05063arXiv1406.3223OpenAlexW2210476325MaRDI QIDQ896858FDOQ896858


Authors: Cid Reyes-Bustos Edit this on Wikidata


Publication date: 14 December 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these properties to those of the underlying group-subgroup pair. From the properties of the group, subgroup and generating set some of the eigenvalues can be determined, including the largest eigenvalue of the graph. In particular, when this construction results in a bipartite regular graph we show a sufficient condition on the size of the generating sets that results on Ramanujan graphs for a fixed group-subgroup pair. Examples of Ramanujan pair-graphs that do not satisfy this condition are also provided, to show that the condition is not necessary.


Full work available at URL: https://arxiv.org/abs/1406.3223




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Cayley-type graphs for group-subgroup pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896858)