Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Binzhou Xia"'
Publikováno v:
Journal of Algebra. 626:1-38
In 2017, Giudici, Li and the third author constructed the first known family of vertex-primitive $2$-arc-transitive digraphs of valency at least $2$. The smallest digraph in this family admits $\mathrm{PSL}_3(49)$ acting $2$-arc-transitively with ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdfa056cc721b743898203d81c506d21
https://doi.org/10.1016/j.jalgebra.2023.02.028
https://doi.org/10.1016/j.jalgebra.2023.02.028
Publikováno v:
Communications in Algebra. :1-5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1caaabba0926b18d51ad3eb60d8489a4
https://doi.org/10.1080/00927872.2023.2187627
https://doi.org/10.1080/00927872.2023.2187627
Publikováno v:
Journal of Algebra. 610:655-683
An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study of $2$-arc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d64fb240deef7da45f2102293662b084
https://doi.org/10.1016/j.jalgebra.2022.07.025
https://doi.org/10.1016/j.jalgebra.2022.07.025
Publikováno v:
Journal of Combinatorial Theory, Series B. 150:1-16
A reductive characterization of arc-transitive circulants was given independently by Kovacs in 2004 and the first author in 2005. In this paper, we give an explicit characterization of arc-transitive circulants and their automorphism groups . Based o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04cc63533ddf3def52ca07894a155672
https://doi.org/10.1016/j.jctb.2021.02.004
https://doi.org/10.1016/j.jctb.2021.02.004
Autor:
Binzhou Xia
Publikováno v:
Journal of Combinatorial Theory, Series B. 147:159-182
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct half-arc-transitive gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b849c79bd7a6a11c5d7bbf7da401e5c
https://doi.org/10.1016/j.jctb.2020.12.001
https://doi.org/10.1016/j.jctb.2020.12.001
Publikováno v:
Journal of Combinatorial Theory, Series B. 147:71-95
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs ( Γ , Σ ) is stable if Aut ( Γ × Σ ) ≅ Aut ( Γ ) × Aut ( Σ ) and unstable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7aa51b8de439c2bbf3bab45685f30a45
https://doi.org/10.1016/j.jctb.2020.10.002
https://doi.org/10.1016/j.jctb.2020.10.002
Autor:
Binzhou Xia
Publikováno v:
European Journal of Combinatorics. 110:103687
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d431645a6dbc808d11d833a73681ccb2
https://doi.org/10.1016/j.ejc.2023.103687
https://doi.org/10.1016/j.ejc.2023.103687
Publikováno v:
Journal of Graph Theory. 97:70-81
The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable graph is sai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc4104e8ca80dd18fcf230839c2f82e5
https://doi.org/10.1002/jgt.22642
https://doi.org/10.1002/jgt.22642
Autor:
Binzhou Xia
Publikováno v:
Journal of Combinatorial Theory, Series B. 141:1-30
A recent conjecture of the author and Teng Fang states that there are only finitely many finite simple groups with no cubic graphical regular representation. In this paper, we make crucial progress towards this conjecture by giving an affirmative ans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dec3c91d3ebfbabb96b4b0ee576cbf6f
https://doi.org/10.1016/j.jctb.2019.06.002
https://doi.org/10.1016/j.jctb.2019.06.002
Publikováno v:
Journal of Pure and Applied Algebra. 223:5455-5483
We study G -vertex-primitive and ( G , s ) -arc-transitive digraphs for almost simple groups G with socle PSL n ( q ) . We prove that s ⩽ 2 for such digraphs, which provides the first step in determining an upper bound on s for all the vertex-primi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2229c6535617f17e5bb0c0ada1cf7b2
https://doi.org/10.1016/j.jpaa.2019.04.009
https://doi.org/10.1016/j.jpaa.2019.04.009