Low Diameter Algebraic Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Low Diameter Algebraic Graphs

Résumé

Let D be a division ring, n a positive integer, and GLn(D) the set of invertible square matrices of size n and values in D, called the general linear group. We address the intersection graph of subgroups of GLn(D) and prove that it has diameter at most 3. Two particular cases of its induced subgraphs are then investigated: by cyclic subgroups, and by almost subnormal subgroups. We prove that the latter case results in a connected graph whose diameter is sharply bounded by 2. In the former case, we completely characterise the connectivity of the induced graph with respect to D, where, in case of connectivity, we prove that it has diameter at most 7 in general, and at most 5 if D is a locally finite field of characteristic not 2 different from F3 and F9.
Fichier principal
Vignette du fichier
BBLM21.pdf (245.1 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03433624 , version 1 (17-11-2021)

Identifiants

Citer

Hai Bui Xuan, Binh-Minh Bui-Xuan, Le van Chua, Mai Hoang Bien. Low Diameter Algebraic Graphs. European Conference on Combinatorics, Graph Theory and Applications, Sep 2021, Barcelona, Spain. pp.465-471, ⟨10.1007/978-3-030-83823-2_73⟩. ⟨hal-03433624⟩
28 Consultations
41 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More