Etude de spectre de graphe de Cayley
DOI:
https://doi.org/10.5281/zenodo.14021898Keywords:
graphe orienté, graphe régulier, graphe k-partites, matrice d'adjacence, graphe connexe, chemin, spectre d'un graphe, graphe de Cayley, valeurs propres, groupe abélien.Abstract
- The regularity of a directed graph provides us with an eigenvalue that turns out to be the largest in magnitude for such a graph;
- We will also define the notion of a path in a graph to study its connectivity;
- The most interesting point in this work is the concept of the adjacency matrix of a finite regular graph, which will allow us to explore the relationship between the graph's connectivity and the eigenvalues of the matrix;
- We will conclude this work with a method for calculating the eigenvalues of Cayley graphs defined from abelian groups. To this end, we will recall some results from representation theory.
Downloads
Published
2024-11-01
How to Cite
Nestor Anzola Kibamba, Biaba Kuya Jirince, Mpongo Ngentshi Benoît, & Frey Sylvestre. (2024). Etude de spectre de graphe de Cayley. Revue Internationale De La Recherche Scientifique (Revue-IRS), 2(5), 2863–2876. https://doi.org/10.5281/zenodo.14021898
Issue
Section
Articles
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
