Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Ted Dobson"'
This is the first full-length book on the major theme of symmetry in graphs. Forming part of algebraic graph theory, this fast-growing field is concerned with the study of highly symmetric graphs, particularly vertex-transitive graphs, and other comb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::292dd43e4fcf06a586cf8b253a5b0b89
https://doi.org/10.1017/9781108553995
https://doi.org/10.1017/9781108553995
Autor:
Ted Dobson
Publikováno v:
The Art of Discrete and Applied Mathematics. 5:#P3.06
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bc3a0872a91bd11b9484a60c43c79a6
https://doi.org/10.26493/2590-9770.1391.f46
https://doi.org/10.26493/2590-9770.1391.f46
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
Comment: 25 pages
Comment: 25 pages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab6eb9b7a0549a64d236476ac57cf128
Publikováno v:
Ars Mathematica Contemporanea. 22:#P2.07
In this paper, we find a strong new restriction on the structure of CI-groups. We show that, if R is a generalised dihedral group and if R is a CI-group, then for every odd prime p the Sylow p -subgroup of R has order p , or 9 . Consequently, any CI-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eca2f8b2acd4e8f9cee9f18c1960d02f
https://doi.org/10.26493/1855-3974.2443.02e
https://doi.org/10.26493/1855-3974.2443.02e
Publikováno v:
Journal of Algebra. 486:396-416
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of the theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bad59e859904ace814707be5a04b7e3
https://doi.org/10.1016/j.jalgebra.2017.03.043
https://doi.org/10.1016/j.jalgebra.2017.03.043
Autor:
Ted Dobson, Pablo Spiga
Publikováno v:
Journal of Combinatorial Theory, Series B. 122:301-310
A positive integer n is a Cayley number if every vertex-transitive graph of order n is a Cayley graph. In 1983, Dragan Marusic posed the problem of determining the Cayley numbers. In this paper we give an infinite set S of primes such that every fini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::568630cbd3b8ed3f26790249f9568e04
https://doi.org/10.1016/j.jctb.2016.06.005
https://doi.org/10.1016/j.jctb.2016.06.005
Publikováno v:
Mediterranean Journal of Mathematics. 16
Let $$\Gamma _1$$ and $$\Gamma _2$$ be digraphs. The deleted wreath product of $$\Gamma _1$$ and $$\Gamma _2$$, denoted $$\Gamma _1\wr _d\Gamma _2$$, is the digraph with vertex set $$V(\Gamma _1)\times V(\Gamma _2)$$ and arc set $$\{((x_1,y_1),(x_2,y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2f13b75b57060f19db8183ca45fee49
https://doi.org/10.1007/s00009-019-1422-y
https://doi.org/10.1007/s00009-019-1422-y
Autor:
Ted Dobson
Publikováno v:
The Electronic Journal of Combinatorics. 25
A group $G$ is a CI-group with respect to graphs if two Cayley graphs of $G$ are isomorphic if and only if they are isomorphic by a group automorphism of $G$. We show that an infinite family of groups which include $D_n\times F_{3p}$ are not CI-group
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcb1fe00d83f7e158c169a3b24d34fed
https://doi.org/10.37236/6541
https://doi.org/10.37236/6541
Autor:
Ted Dobson
Publikováno v:
Graphs and Combinatorics. 32:913-921
Marusia?---Scapellato graphs are vertex-transitive graphs of order $$m(2^k + 1)$$m(2k+1), where m divides $$2^k - 1$$2k-1, whose automorphism group contains an imprimitive subgroup that is a quasiprimitive representation of $$\mathrm{SL}(2,2^k)$$SL(2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7107e8a3b9d8a5ea89514cd802f69f7d
https://doi.org/10.1007/s00373-015-1640-4
https://doi.org/10.1007/s00373-015-1640-4
Publikováno v:
Ars Mathematica Contemporanea. 9:63-75
In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculatin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9592bba59d145f08be495671d36df613
https://doi.org/10.26493/1855-3974.362.504
https://doi.org/10.26493/1855-3974.362.504