Skip to Main content Skip to Navigation

G-graphs and Expander graphs

Mohamad Badaoui 1
1 Equipe CODAG - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : Applying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graphs that have strongconnectivity properties. Expanders constructions have found extensive applications in bothpure and applied mathematics. Although expanders exist in great abundance, yet their explicitconstructions, which are very desirable for applications, are in general a hard task. Mostconstructions use deep algebraic and combinatorial approaches. Following the huge amountof research published in this direction, mainly through Cayley graphs and the Zig-Zagproduct, we choose to investigate this problem from a new perspective; namely by usingG-graphs theory and spectral hypergraph theory as well as some other techniques. G-graphsare like Cayley graphs defined from groups, but they correspond to an alternative construction.The reason that stands behind our choice is first a notable identifiable link between thesetwo classes of graphs that we prove. This relation is employed significantly to get many newresults. Another reason is the general form of G-graphs, that gives us the intuition that theymust have in many cases such as the relatively high connectivity property.The adopted methodology in this thesis leads to the identification of various approaches forconstructing an infinite family of expander graphs. The effectiveness of our techniques isillustrated by presenting new infinite expander families of Cayley and G-graphs on certaingroups. Also, since expanders stand in no single stem of graph theory, this brings us toinvestigate several closely related threads from a new angle. For instance, we obtain newresults concerning the computation of spectra of certain Cayley and G-graphs, and theconstruction of several new infinite classes of integral and Hamiltonian Cayley graphs.
Document type :
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, July 18, 2018 - 10:00:16 AM
Last modification on : Wednesday, April 15, 2020 - 1:32:18 AM
Long-term archiving on: : Friday, October 19, 2018 - 6:42:58 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01842265, version 1


Mohamad Badaoui. G-graphs and Expander graphs. Discrete Mathematics [cs.DM]. Normandie Université; Université libanaise, 2018. English. ⟨NNT : 2018NORMC207⟩. ⟨tel-01842265⟩



Record views


Files downloads