Results 101 to 110 of about 1,144 (198)
Journal of Algebra, 1989 Given a graph \(\Gamma=(V,E)\), the graph group \(F\langle\Gamma\rangle\) is the group with presentation \(\langle V\mid [E]\rangle\), where \([E]\) denotes the set of commutators \(\{[a,b]\mid\{a,b\}\in E\}\). The graph group \(F\langle\Gamma\rangle\) is modeled to be a group analog of the graph algebra K(\(\Gamma)\) generated as a free associative ...
openaire +2 more sources
Some infinite classes of asymmetric nearly Hamiltonian snarks
Le Matematiche, 2010 We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one.
Carla Fiori, Beatrice Ruini
doaj
Automorphisms of relatively hyperbolic groups and the Farrell-Jones conjecture. [PDF]
Math AnnAndrew N, Guerch Y, Hughes S.
europepmc +1 more source
Extension of partial atom-to-atom maps: uniqueness and algorithms. [PDF]
Algorithms Mol BiolLaffitte MEG, Phan TL, Stadler PF.
europepmc +1 more source
The group of automorphisms of the holomorph of a group [PDF]
Pacific Journal of Mathematics, 1961 openaire +3 more sources
Groups acting on trees with Tits' independence property (P): With an appendix by Stephan Tornier. [PDF]
Math AnnReid CD, Smith SM.
europepmc +1 more source
On the order of groups of automorphisms [PDF]
Transactions of the American Mathematical Society, 1936 Birkhoff, Garrett, Hall, Philip
openaire +2 more sources
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning. [PDF]
Entropy (Basel)Tian K, Liu R, Lu Z.
europepmc +1 more source
Symmetries and symmetry-breaking in arithmetic graphs. [PDF]
Heliyon, 2023 Shah A, Javaid I, Rehman SU.
europepmc +1 more source