Results 131 to 140 of about 420,658 (213)
On non-Cayley vertex-transitive graphs and the Meta-Cayley graphs
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time now. In that vein, Alspach and Parsons [1] introduced metacirculant graphs.
Mwambene, Eric
core
Strongly regular tri-Cayley graphs
A graph is called tri-Cayley if it admits a semiregular subgroup of automorphisms having three orbits of equal length. In this paper, the structure of strongly regular tri-Cayley graphs is investigated.
Miklavič, Štefko +3 more
core +1 more source
Seeing Is Believing: Brain-Inspired Modular Training for Mechanistic Interpretability. [PDF]
Liu Z, Gan E, Tegmark M.
europepmc +1 more source
Presentations for vertex-transitive graphs. [PDF]
Georgakopoulos A, Wendland A.
europepmc +1 more source
Chromatic number of Cayley graphs
openNella tesi viene trattato il problema del numero cromatico dei grafi di Cayley (minimali). Inizialmente si tratterà lo studio del numero cromatico minimo che risulterà essere minore o uguale a 3 per ogni grafo di Cayley. Successivamente si porrà l'
STACCO, FLAVIO
core
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure. [PDF]
Liqin L +4 more
europepmc +1 more source
An algebraic model for inversion and deletion in bacterial genome rearrangement. [PDF]
Clark C +3 more
europepmc +1 more source
Average distance between the processors of biswapped networks. [PDF]
Prabhu S +3 more
europepmc +1 more source
Hypercomplex neural networks: Exploring quaternion, octonion, and beyond in deep learning. [PDF]
Devadas RM +5 more
europepmc +1 more source

