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 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Sectional split extensions arising from lifts of groups
Rok Požar, 2013, izvirni znanstveni članek

Opis: Covering techniques have recently emerged as an effective tool used for classification of several infinite families of connected symmetric graphs. One commonly encountered technique is based on the concept of lifting groups of automorphisms along regular covering projections ▫$\wp \colon \tilde{X} \to X$▫. Efficient computational methods are known for regular covers with cyclic or elementary abelian group of covering transformations CT▫$(\wp)$▫. In this paper we consider the lifting problem with an additional condition on how a group should lift: given a connected graph ▫$X$▫ and a group ▫$G$▫ of its automorphisms, find all connected regular covering projections ▫$\wp \colon \tilde{X} \to X$▫ along which ▫$G$▫ lifts as a sectional split extension. By this we mean that there exists a complement ▫$\overline{G}$▫ of CT▫$(\wp)$▫ within the lifted group ▫$\tilde{G}$▫ such that ▫$\overline{G}$▫ has an orbit intersecting each fibre in at most one vertex. As an application, all connected elementary abelian regular coverings of the complete graph ▫$K_4$▫ along which a cyclic group of order 4 lifts as a sectional split extension are constructed.
Ključne besede: covering projection, graph, group extension, lifting automorphisms, voltage assignment
Objavljeno v RUP: 31.12.2021; Ogledov: 989; Prenosov: 3
.pdf Celotno besedilo (365,16 KB)

2.
3.
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: 3475; 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