Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Majid Arezoomand"'
Publikováno v:
Bulletin of Mathematical Sciences, Vol 14, Iss 01 (2024)
A finite permutation group [Formula: see text] is called [Formula: see text]-closed if [Formula: see text] is the largest subgroup of [Formula: see text] which leaves invariant each of the [Formula: see text]-orbits for the induced action on [Formula
Externí odkaz:
https://doaj.org/article/568b29b6f2da44daab0c9641942a42da
Autor:
Majid Arezoomand
Publikováno v:
پژوهشهای ریاضی, Vol 8, Iss 2, Pp 1-18 (2022)
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively. Also by Z
Externí odkaz:
https://doaj.org/article/7e038d1ac12e41189d67a120e05d839e
Autor:
Majid Arezoomand
Publikováno v:
Transactions on Combinatorics, Vol 10, Iss 4, Pp 247-252 (2021)
Let $k\geq 1$ be an integer and $\mathcal{I}_k$ be the set of all finite groups $G$ such that every bi-Cayley graph BCay(G,S) of $G$ with respect to subset $S$ of length $1\leq |S|\leq k$ is integral. Let $k\geq 3$. We prove t
Externí odkaz:
https://doaj.org/article/bce305e2ac5c40618de94099619074f8
Publikováno v:
Transactions on Combinatorics, Vol 8, Iss 1, Pp 15-40 (2019)
Fixed-point-free permutations, also known as derangements, have been studied for centuries. In particular, depending on their applications, derangements of prime-power order and of prime order have always played a crucia
Externí odkaz:
https://doaj.org/article/6f3170c6775c4fa69c6a29a9b7ddd532
Autor:
Majid Arezoomand
Publikováno v:
Mathematics Interdisciplinary Research, Vol 3, Iss 2, Pp 131-134 (2018)
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
Externí odkaz:
https://doaj.org/article/5257ac5559a94a48b8f27ea63a009c8d
Autor:
Majid Arezoomand, Bijan Taeri
Publikováno v:
International Journal of Group Theory, Vol 5, Iss 2, Pp 1-6 (2016)
Let $S$ be a subset of a finite group $G$. The bi-Cayley graph ${rm BCay}(G,S)$ of $G$ with respect to $S$ is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin G, sin S}$. A bi-Cayley graph $
Externí odkaz:
https://doaj.org/article/92361858a6f14072a0be84a42da6bb62
Autor:
Majid Arezoomand, Bijan Taeri
Publikováno v:
Transactions on Combinatorics, Vol 4, Iss 4, Pp 55-61 (2015)
The bi-Cayley graph of a finite group G with respect to a subset S⊆G , which is denoted by \BCay(G,S) , is the graph with vertex set G×{1,2} and edge set {{(x,1),(sx,2)}∣x∈G, s∈S} . A finite group G
Externí odkaz:
https://doaj.org/article/1ff66adc98024f03bf3db3ca5bf5d856
Publikováno v:
Comptes Rendus. Mathématique. 360:1001-1008
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c6e405df1cc3ccd9ca09ebf103ce1a4
https://doi.org/10.5802/crmath.355
https://doi.org/10.5802/crmath.355
Publikováno v:
Linear Algebra and its Applications. 639:116-134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9cb8a64786b7cb9667d7ab00bc59c7e
https://doi.org/10.1016/j.laa.2021.12.019
https://doi.org/10.1016/j.laa.2021.12.019
Publikováno v:
Bulletin of Mathematical Sciences.
A group $G$ is said to be totally $2$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits for the induced action on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a157edb32b491f5e180d2bf6bf1fcc6c
https://doi.org/10.1142/s1664360723500042
https://doi.org/10.1142/s1664360723500042