60/102 Null Boundary Cellular Automata based expander graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2010

60/102 Null Boundary Cellular Automata based expander graphs

Résumé

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et al. introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor Cellular Automata(CA). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null Boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is maximal. Moreover, the spectral gap is larger than that of Mukhopadhyay et al.
Fichier principal
Vignette du fichier
dmAL0102.pdf (338.02 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01185496 , version 1 (20-08-2015)

Identifiants

Citer

Sung-Jin Cho, Un-Sook Choi, Han-Doo Kim, Yoon-Hee Hwang, Jin-Gyoung Kim. 60/102 Null Boundary Cellular Automata based expander graphs. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.19-28, ⟨10.46298/dmtcs.2760⟩. ⟨hal-01185496⟩

Collections

TDS-MACS
80 Consultations
682 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More