Ramanujan graphs arising as weighted Galois covering graphs
We give a new construction of Ramanujan graphs using a generalized type of covering graph called a weighted covering graph. For a given prime p the basic construction produces bipartite Ramanujan graphs with 4p vertices and degrees 2N where roughly $p + 1 - \sqrt{2p} < N \le p$. We then give gene...
Saved in:
Main Authors: | Minei, Marvin; Pacific Missile Range Facility, Department of Navy, Barking Sands, HI 96752 (Author), Skogman, Howard; Department of Mathematics, College at Brockport, SUNY, Brockport, NY 14420 (Author) |
---|---|
Other Authors: | Marvin Minei (Contributor) |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-04-03.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Block circulant graphs and the graphs of critical pairs of crowns
by: Garcia, Rebecca E.; Department of Mathematics and Statistics, Sam Houston State University, et al.
Published: (2019) -
On an edge partition and root graphs of some classes of line graphs
by: Pravas, K; Department of Mathematics, K. K. T. M. Government College, Pullut-680663, India, et al.
Published: (2017) -
Cofinite graphs and their profinite completions
by: Acharyya, Amrita; Department of Mathematics and Statistics, University of Toledo, et al.
Published: (2017) -
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
by: Fahnenstiel, John; Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A, et al.
Published: (2019) -
Connected domination value in graphs
by: Das, Angsuman; Department of Mathematics, Presidency University, Kolkata, India
Published: (2021)