Zobrazeno 1 - 10
of 162
pro vyhledávání: '"Yan-Quan Feng"'
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:
In Journal of Visual Communication and Image Representation January 2019 58:102-111
Publikováno v:
Journal of Algebraic Combinatorics. 56:475-492
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::875f262177b9ebd51f64d6ec3a2bbaca
https://doi.org/10.1007/s10801-022-01119-0
https://doi.org/10.1007/s10801-022-01119-0
Publikováno v:
Discrete Applied Mathematics. 304:137-152
Let Γ n be the symmetric group on { 1 , 2 , … , n } and S be the generating set of Γ n . The corresponding Cayley graph is denoted by Γ n ( S ) . If all elements of S are transpositions, a simple way to depict S is to via a graph, called the tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f318a036745300db9bd781cf48c5f0e3
https://doi.org/10.1016/j.dam.2021.07.022
https://doi.org/10.1016/j.dam.2021.07.022
Publikováno v:
Journal of Graph Theory. 98:234-254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2948a797c6d65c0fd671f8bde14609f9
https://doi.org/10.1002/jgt.22690
https://doi.org/10.1002/jgt.22690
Publikováno v:
Journal of Algebra. 569:713-722
We construct two infinite families of locally toroidal chiral polytopes of type $\{4,4,4\}$, with $1024m^2$ and $2048m^2$ automorphisms for every positive integer $m$, respectively. The automorphism groups of these polytopes are solvable groups, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0871b8f67e3798fd6ef426b458e37d1
https://doi.org/10.1016/j.jalgebra.2020.11.002
https://doi.org/10.1016/j.jalgebra.2020.11.002
Publikováno v:
Discrete Applied Mathematics. 284:207-223
The edge-Szeged index of a graph G is defined as S z e ( G ) = ∑ u v ∈ E ( G ) m u ( u v | G ) m v ( u v | G ) , where m u ( u v | G ) (resp., m v ( u v | G ) ) is the number of edges whose distance to vertex u (resp., v ) is smaller than the dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2e082b7da6ddf7ca84e0b7d2204dea3
https://doi.org/10.1016/j.dam.2020.03.033
https://doi.org/10.1016/j.dam.2020.03.033
A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $\Gamma$ such that the automorphism group $\mathrm{Aut}(\Gamma)$ of $\Gamma$ satisfies the following properties: $\mathrm{Aut}(\Ga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13a04b03f1713149be0a7db6be7fe835
http://hdl.handle.net/10281/375391
http://hdl.handle.net/10281/375391
Publikováno v:
Applied Mathematics and Computation. 436:127499
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b088a35ea71d216c5eb4bdd286eeb1b4
https://doi.org/10.1016/j.amc.2022.127499
https://doi.org/10.1016/j.amc.2022.127499
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and Maru\v{s}i\v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b102bc2de19a6a9097f00fbb83862802
http://arxiv.org/abs/2107.14479
http://arxiv.org/abs/2107.14479