Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 15
First pagePrevious page12Next pageLast page
1.
Reachability relations, transitive digraphs and groups
Aleksander Malnič, Primož Potočnik, Norbert Seifter, Primož Šparl, 2015, original scientific article

Abstract: In [A. Malnič, D. Marušič, N. Seifter, P. Šparl and B. Zgrablič, Reachability relations in digraphs, Europ. J. Combin. 29 (2008), 1566-1581] it was shown that properties of digraphs such as growth, property ▫$\mathbf{Z}$▫, and number of ends are reflected by the properties of certain reachability relations defined on the vertices of the corresponding digraphs. In this paper we study these relations in connection with certain properties of automorphism groups of transitive digraphs. In particular, one of the main results shows that if atransitive digraph admits a nilpotent subgroup of automorphisms with finitely many orbits, then its nilpotency class and the number of orbits are closely related to particular properties of reachability relations defined on the digraphs in question. The obtained results have interesting implications for Cayley digraphs of certain types of groups such as torsion-free groups of polynomial growth.
Keywords: Cayley digraph, reachability relation
Published in RUP: 31.12.2021; Views: 783; Downloads: 16
.pdf Full text (311,92 KB)

2.
3.
4.
5.
6.
7.
8.
9.
10.
Reachability relations in digraphs
Aleksander Malnič, Dragan Marušič, Norbert Seifter, Primož Šparl, Boris Zgrablić, 2008, original scientific article

Abstract: 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 traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.
Keywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Published in RUP: 03.04.2017; Views: 2675; Downloads: 133
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica