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


11 - 20 / 85
Na začetekNa prejšnjo stran123456789Na naslednjo stranNa konec
11.
Primitive groups of degree twice a prime number
Dragan Marušič, 2012, vabljeno predavanje na konferenci brez natisa

Najdeno v: ključnih besedah
Povzetek najdenega: ...primitive group, strongly regular graph, primitive action, ...
Ključne besede: primitive group, strongly regular graph, primitive action
Objavljeno: 15.10.2013; Ogledov: 1635; Prenosov: 24
URL Polno besedilo (0,00 KB)

12.
On quartic half-arc-transitive metacirculants
Dragan Marušič, Primož Šparl, 2008, izvirni znanstveni članek

Opis: Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫, where ▫$\rho$▫ is ▫$(m,n)$▫-semiregular for some integers ▫$m \ge 1$▫, ▫$n \ge 2▫$, and where ▫$\sigma$▫ normalizes ▫$\rho$▫, cyclically permuting the orbits of ▫$\rho$▫ in such a way that ▫$\sigma^m$▫ has at least one fixed vertex. A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. In this article quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed.
Najdeno v: ključnih besedah
Povzetek najdenega: ...graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫,...
Ključne besede: mathematics, graph theory, metacirculant graph, half-arc-transitive graph, tightly attached, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1698; Prenosov: 62
URL Polno besedilo (0,00 KB)

13.
On the proof of a theorem of Pálfy
Edward Dobson, 2006, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...CI- group, Euler's phi function, ...
Ključne besede: CI-group, Euler's phi function
Objavljeno: 15.10.2013; Ogledov: 1656; Prenosov: 11
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

14.
Primitive bicirculant association schemes and a generalization of Wielandt's theorem
István Kovács, Dragan Marušič, Mikhail Muzychuk, 2010, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...permutation group, association scheme, primitive association scheme, ...
Ključne besede: permutation group, association scheme, primitive association scheme
Objavljeno: 15.10.2013; Ogledov: 1595; Prenosov: 68
URL Polno besedilo (0,00 KB)

15.
The full automorphism group of a Cayley graph
Gabriel Verret, 2013, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Ključne besede: automorphism group, Cayley graph
Objavljeno: 15.10.2013; Ogledov: 2294; Prenosov: 20
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

16.
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.
Najdeno v: ključnih besedah
Povzetek najdenega: ...mathematics, semioval, group factorization...
Ključne besede: mathematics, semioval, group factorization
Objavljeno: 15.10.2013; Ogledov: 1284; Prenosov: 60
URL Polno besedilo (0,00 KB)

17.
Distance-regular Cayley graphs on dihedral groups
Štefko Miklavič, Primož Potočnik, 2007, izvirni znanstveni članek

Opis: The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every non-trivial distance-regular Cayley graph on a dihedral group is bipartite, non-antipodal, has diameter 3 and arises either from a cyclic di#erence set, or possibly (if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all distance-transitive Cayley graphs on dihedral groups are determined. It transpires that a Cayley graph on a dihedral group is distance-transitive if and only if it is trivial, or isomorphic to the incidence or to the non-incidence graph of a projective space ▫$\mathrm{PG}_{d-1} (d,q)$▫, ▫$d \ge 2$▫, or the unique pair of complementary symmetric designs on 11 vertices.
Najdeno v: ključnih besedah
Povzetek najdenega: ...classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such...
Ključne besede: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Objavljeno: 15.10.2013; Ogledov: 1270; Prenosov: 56
URL Polno besedilo (0,00 KB)

18.
Decomposition of skew-morphisms of cyclic groups
István Kovács, Roman Nedela, 2011, izvirni znanstveni članek

Opis: A skew-morphism of a group ▫$H$▫ is a permutation ▫$\sigma$▫ of its elements fixing the identity such that for every ▫$x, y \in H$▫ there exists an integer ▫$k$▫ such that ▫$\sigma (xy) = \sigma (x)\sigma k(y)$▫. It follows that group automorphisms are particular skew-morphisms. Skew-morphisms appear naturally in investigations of maps on surfaces with high degree of symmetry, namely, they are closely related to regular Cayley maps and to regular embeddings of the complete bipartite graphs. The aim of this paper is to investigate skew-morphisms of cyclic groups in the context of the associated Schur rings. We prove the following decomposition theorem about skew-morphisms of cyclic groups ▫$\mathbb Z_n$▫: if ▫$n = n_{1}n_{2}$▫ such that ▫$(n_{1}n_{2}) = 1$▫, and ▫$(n_{1}, \varphi (n_{2})) = (\varphi (n_{1}), n_{2}) = 1$▫ (▫$\varphi$▫ denotes Euler's function) then all skew-morphisms ▫$\sigma$▫ of ▫$\mathbb Z_n$▫ are obtained as ▫$\sigma = \sigma_1 \times \sigma_2$▫, where ▫$\sigma_i$▫ are skew-morphisms of ▫$\mathbb Z_{n_i}, \; i = 1, 2$▫. As a consequence we obtain the following result: All skew-morphisms of ▫$\mathbb Z_n$▫ are automorphisms of ▫$\mathbb Z_n$▫ if and only if ▫$n = 4$▫ or ▫$(n, \varphi(n)) = 1$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...A skew-morphism of a group ▫$H$▫ is a permutation ▫$\sigma$▫ of its...
Ključne besede: cyclic group, permutation group, skew-morphism, Schur ring
Objavljeno: 15.10.2013; Ogledov: 1932; Prenosov: 54
URL Polno besedilo (0,00 KB)

19.
On 2-fold covers of graphs
Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A regular covering projection ▫$\wp : \widetilde{X} \to X$▫ of connected graphs is ▫$G$▫-admissible if ▫$G$▫ lifts along ▫$\wp$▫. Denote by ▫$\tilde{G}$▫ the lifted group, and let CT▫$(\wp)$▫ be the group of covering transformations. The projection is called ▫$G$▫-split whenever the extension ▫{$\mathrm{CT}}(\wp) \to \tilde{G} \to G$▫ splits. In this paper, split 2-covers are considered, with a particular emphasis given to cubic symmetric graphs. Supposing that ▫$G$▫ is transitive on ▫$X$▫, a ▫$G$▫-split cover is said to be ▫$G$▫-split-transitive if all complements ▫$\tilde{G} \cong G$▫ of CT▫$(\wp)$▫ within ▫$\tilde{G}$▫ are transitive on ▫$\widetilde{X}$▫; it is said to be ▫$G$▫-split-sectional whenever for each complement ▫$\tilde{G}$▫ there exists a ▫$\tilde{G}$▫-invariant section of ▫$\wp$▫; and it is called ▫$G$▫-split-mixed otherwise. It is shown, when ▫$G$▫ is an arc-transitive group, split-sectional and split-mixed 2-covers lead to canonical double covers. Split-transitive covers, however, are considerably more difficult to analyze. For cubic symmetric graphs split 2-cover are necessarily canonical double covers (that is, no ▫$G$▫-split-transitive 2-covers exist) when ▫$G$▫ is 1-regular or 4-regular. In all other cases, that is, if ▫$G$▫ is ▫$s$▫-regular, ▫$s=2,3$▫ or ▫$5$▫, a necessary and sufficient condition for the existence of a transitive complement ▫$\tilde{G}$▫ is given, and moreover, an infinite family of split-transitive 2-covers based on the alternating groups of the form ▫$A_{12k+10}$▫ is constructed. Finally, chains of consecutive 2-covers, along which an arc-transitive group ▫$G$▫ has successive lifts, are also considered. It is proved that in such a chain, at most two projections can be split. Further, it is shown that, in the context of cubic symmetric graphs, if exactly two of them are split, then one is split-transitive and the other one is either split-sectional or split-mixed.
Najdeno v: ključnih besedah
Povzetek najdenega: ...along ▫$\wp$▫. Denote by ▫$\tilde{G}$▫ the lifted group, and let CT▫$(\wp)$▫ be the group of...
Ključne besede: graph theory, graphs, cubic graphs, symmetric graphs, ▫$s$▫-regular group, regular covering projection
Objavljeno: 15.10.2013; Ogledov: 1293; Prenosov: 14
URL Polno besedilo (0,00 KB)

20.
Asymptotic automorphism groups of Cayley digraphs and graphs of abelian groups of prime-power order
Edward Dobson, 2010, izvirni znanstveni članek

Opis: We show that almost every Cayley graph ▫$\Gamma$▫ of an abelian group ▫$G$▫ of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph ▫$\Gamma$▫ of an abelian group ▫$G$▫ of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of ▫$G$▫ (that is, ▫$G_L \triangleleft {\rm Aut}(\Gamma))$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...every Cayley graph ▫$\Gamma$▫ of an abelian group ▫$G$▫ of odd prime-power order has automorphism...
Ključne besede: mathematics, graph theory, Cayley graph, abelian group, automorphism group, asymptotic, ▫$p$▫-group
Objavljeno: 15.10.2013; Ogledov: 2526; Prenosov: 58
URL Polno besedilo (0,00 KB)

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