Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 5 / 5
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Integral automorphisms of affine spaces over finite fields
István Kovács, Klavdija Kutnar, János Ruff, Tamás Szőnyi, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: finite field, affine space, integral distance, integral automorphism
Objavljeno v RUP: 08.08.2016; Ogledov: 2893; Prenosov: 80
URL Povezava na celotno besedilo

2.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, izvirni znanstveni članek

Opis: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.
Ključne besede: degree, diameter problem, Moore bound, finite projective spaces
Objavljeno v RUP: 15.10.2013; Ogledov: 3337; Prenosov: 69
URL Povezava na celotno besedilo

3.
4.
Semiovals contained in the union of three concurrent lines
Aart Blokhuis, György Kiss, István Kovács, Aleksander Malnič, Dragan Marušič, János Ruff, 2007, izvirni znanstveni članek

Opis: Semiovals which are contained in the union of three concurrent lines are studied. The notion of a strong semioval is introduced, and a complete classification of these objects in PG▫$(2,p)$▫ and PG▫$(2,p^2)$▫, ▫$p$▫ an odd prime, is given.
Ključne besede: mathematics, semioval, group factorization
Objavljeno v RUP: 15.10.2013; Ogledov: 2907; Prenosov: 130
URL Povezava na celotno besedilo

5.
Rose window graphs underlying rotary maps
István Kovács, Klavdija Kutnar, János Ruff, 2010, objavljeni znanstveni prispevek na konferenci

Opis: Given natural numbers ▫$n \ge 3$▫ and ▫$1 \le a$▫, ▫$r \le n-1$▫, the rose window graph ▫$R_n(a,r)$▫ is a quartic graph with vertex set ▫$\{x_i \vert\; i \in {\mathbb Z}_n \} \cup \{y_i \vert\; i \in {\mathbb Z}_n \}$▫ and edge set ▫$\{\{x_i, x_{i+1}\} \vert\; i \in {\mathbb Z}_n \} \cup \{\{y_i, y_{i+1}\} \vert\; i \in {\mathbb Z}_n \} \cup \{\{x_i, y_i\} \vert\; i \in {\mathbb Z}_n\} \cup \{\{x_{i+a}, y_i\} \vert\; i \in {\mathbb Z}_n \}$▫. In this paper rotary maps on rose window graphs are considered. In particular, we answer the question posed in [S. Wilson, Rose window graphs, Ars Math. Contemp. 1 (2008), 7-19. http://amc.imfm.si/index.php/amc/issue/view/5] concerning which of these graphs underlie a rotary map.
Ključne besede: graph theory, rotary map, edge-transitive graph, covering graph, voltage graph
Objavljeno v RUP: 15.10.2013; Ogledov: 3545; Prenosov: 87
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.03 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici