Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Norbert Seifter"'
Publikováno v:
Discrete Mathematics. 342:768-776
A general method for constructing sharply k -arc-transitive digraphs, i.e. digraphs that are k -arc-transitive but not ( k + 1 ) -arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fec4a4c8a624518b304d2c3728c301e
https://doi.org/10.1016/j.disc.2018.11.001
https://doi.org/10.1016/j.disc.2018.11.001
Publikováno v:
European Journal of Combinatorics. 77:78-89
A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, local quasi-primitivity and prime out-valency, imply that an arc-transitiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9953f950f13627a021aba4c8beb81140
https://doi.org/10.1016/j.ejc.2018.10.010
https://doi.org/10.1016/j.ejc.2018.10.010
Autor:
Norbert Seifter
Publikováno v:
Ljubljana-Leoben Graph Theory Seminar: Maribor, 13.-15. September, 2017 Book of Abstracts ISBN: 9789612861131
Ljubljana-Leoben Graph Theory Seminar: Maribor, 13.-15. September, 2017 Book of Abstracts
Ljubljana-Leoben Graph Theory Seminar: Maribor, 13.-15. September, 2017 Book of Abstracts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5c39c06ed49d13e15b284fe49105d8f
https://doi.org/10.18690/978-961-286-113-1.17
https://doi.org/10.18690/978-961-286-113-1.17
Publikováno v:
European Journal of Combinatorics. 29(7):1566-1581
In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bab18100afa334ad64bcf7405c7b718
Autor:
Norbert Seifter
Publikováno v:
Discrete Mathematics. 308:1531-1537
In this paper we investigate infinite, locally finite, connected, transitive digraphs with more than one end. For undirected graphs with these properties it has been shown that they are trees as soon as they are 2-arc transitive. In the case of digra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dde508a85adf34bafd2c6e21980995f1
https://doi.org/10.1016/j.disc.2007.04.011
https://doi.org/10.1016/j.disc.2007.04.011
Autor:
Aleksander Malnič, Boris Zgrablić, Dragan Marušič, Norbert Seifter, Rögnvaldur G. Möller, Vladimir I. Trofimov
Publikováno v:
European Journal of Combinatorics. 26(1):19-28
Let D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachability relation is not universal in D provided that the stabilizer of an edge satisfies certain conditions which seem to be typical for highly arc transitive d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8d5c1dc71d1522d52d3d42d3f1dcc41
Publikováno v:
Combinatorica. 22:435-443
In an infinite digraph D, an edge e' is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e'. Reachability is an equivalence relation and if D is 1-arc-transitive, then this relation is eithe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca22c4795fc5b1e43959bd66b3746894
https://doi.org/10.1007/s004930200022
https://doi.org/10.1007/s004930200022
Autor:
Norbert Seifter, Wolfgang Woess
Publikováno v:
Glasgow Mathematical Journal. 42:1-8
Let X be an infinite, locally finite, almost transitive graph with polynomial growth. We show that such a graph X is the inverse limit of an infinite sequence of finite graphs satisfying growth conditions which are closely related to growth propertie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6ac562d260d5226b66b595577687e1f
https://doi.org/10.1017/s001708950001003x
https://doi.org/10.1017/s001708950001003x
Autor:
András Lukács, Norbert Seifter
Publikováno v:
Discrete Mathematics. 186:227-236
We present results on the structure of graphs with polynomial growth. For certain classes of these graphs we prove that they contain subgraphs which are similar to the lattice graph L d . These results are then applied to investigate isoperimetric pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f31eab57bd6f7981dbbbc804145bd8c
https://doi.org/10.1016/s0012-365x(97)00194-5
https://doi.org/10.1016/s0012-365x(97)00194-5
Autor:
Vladimir I. Trofimov, Norbert Seifter
Publikováno v:
Journal of Combinatorial Theory, Series B. 71(2):205-210
LetΓbe a graph with almost transitive group Aut(Γ) and quadratic growth. We show that Aut(Γ) contains an almost transitive subgroup isomorphic to the free abelian group Z2.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1a0352573b974fbbca8f043b1fc9c21