Lupa

Search the repository Help

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

Options:
  Reset


21 - 30 / 72
First pagePrevious page12345678Next pageLast page
21.
22.
Classification of nilpotent 3-BCI-groups
Sergio Hiroki Koike Quintanar, István Kovács, 2018, original scientific article

Keywords: bi-Cayley graph, BCI-group, graph isomorphism
Published in RUP: 02.03.2018; Views: 20238; Downloads: 66
URL Link to full text

23.
24.
Some new groups which are not CI-groups with respect to graphs
Edward Dobson, 2018, original scientific article

Keywords: Cayley graph, CI-group, isomorphism
Published in RUP: 21.02.2018; Views: 2916; Downloads: 153
URL Link to full text
This document has more files! More...

25.
On normality of n-Cayley graphs
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2018, published scientific conference contribution abstract (invited lecture)

Keywords: n-Cayley graph, normality, automorphism group
Published in RUP: 07.02.2018; Views: 2820; Downloads: 108
URL Link to full text

26.
Symmetric graphs: why semiregularity matters
Dragan Marušič, 2018, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive graph, semiregular automorphism, elusive group, solvable group
Published in RUP: 07.02.2018; Views: 2060; Downloads: 28
URL Link to full text

27.
Graphs with large minimal vertex-transitive automorphism groups
Robert Jajcay, 2018, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive graph, automorphism group, symmetric graph
Published in RUP: 07.02.2018; Views: 1887; Downloads: 30
URL Link to full text

28.
Which Haar graphs are Cayley graphs?
István Estélyi, Tomaž Pisanski, 2016, original scientific article

Keywords: Haar graph, Cayley graph, dihedral group, generalized dihedral group
Published in RUP: 16.11.2017; Views: 3465; Downloads: 94
URL Link to full text

29.
30.
Odd automorphisms in vertex-transitive graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, original scientific article

Abstract: An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.
Keywords: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Published in RUP: 15.11.2017; Views: 2305; Downloads: 100
.pdf Full text (281,25 KB)

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