Let Γ be a finite connected G-vertex-transitive graph and let v be a vertex of Γ. If the permutation group induced by the action of the vertex-stabiliser G v on the neighbourhood Γ(v) is permutation isomorphic to L, then (Γ,G) is said to be locally L. A permutation group L is graph-restrictive if there exists a constant c(L) such that, for every locally L pair (Γ,G) and a vertex v of Γ, the inequality |G v |≤c(L) holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular. © 2013 Springer Science+Business Media New York.
Spiga, P., & Verret, G. (2014). On intransitive graph-restrictive permutation groups. JOURNAL OF ALGEBRAIC COMBINATORICS, 40(1), 179-185.
Citazione: | Spiga, P., & Verret, G. (2014). On intransitive graph-restrictive permutation groups. JOURNAL OF ALGEBRAIC COMBINATORICS, 40(1), 179-185. |
Tipo: | Articolo in rivista - Articolo scientifico |
Carattere della pubblicazione: | Scientifica |
Presenza di un coautore afferente ad Istituzioni straniere: | Si |
Titolo: | On intransitive graph-restrictive permutation groups |
Autori: | Spiga, P; Verret, G |
Autori: | SPIGA, PABLO (Primo) |
Data di pubblicazione: | 2014 |
Lingua: | English |
Rivista: | JOURNAL OF ALGEBRAIC COMBINATORICS |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/s10801-013-0482-5 |
Appare nelle tipologie: | 01 - Articolo su rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
art%3A10.1007%2Fs10801-013-0482-5.pdf | N/A | Administrator Richiedi una copia |