Open AccessExpander Graphs – A Study
Author(s) -
D. Angel,
R. Mary Jeya Jothi,
R. Revathi,
A. Raja
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1770/1/012078
Subject(s) - expander graph , ramanujan's sum , indifference graph , chordal graph , pathwidth , modular decomposition , chromatic scale , graph product , combinatorics , mathematics , computer science , discrete mathematics , 1 planar graph , graph , line graph
Expander graphs are highly connected graphs that have numerous applications in statistical physics, pure mathematics and in computer science. The increased connectivity in expanders are useful to model connections between interconnecting systems which can be considered as a graph composed of particles as vertices and edges represent interactions. This paper focuses on the fascinating and highly active area of research on expander graphs. In this article, different classes of expander graphs such as Schreier graphs, Ramanujan graphs and Lp-expanders are categorized and various constructions of an explicit family of expanders are explored. Based on their construction the chromatic number of these are graphs are obtained.