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


21 - 30 / 69
Na začetekNa prejšnjo stran1234567Na naslednjo stranNa konec
21.
22.
European project for truancy prevention and mental health promotion - WE STAY project
Marianna D'Aulerio, Dragan Marušič, Vita Poštuvan, 2012, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: osebi
Ključne besede: WE-STAY, truancy, adolescents, mental health promotion, preventive programme
Objavljeno: 15.10.2013; Ogledov: 1795; Prenosov: 12
URL Polno besedilo (0,00 KB)

23.
Hamiltonicity of cubic Cayley graphs
Dragan Marušič, Henry Glover, Klavdija Kutnar, Aleksander Malnič, 2012, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: osebi
Ključne besede: Cayley graph, Hamilton path, Hamilton cycle, arc-transitive graph, Cayley map
Objavljeno: 15.10.2013; Ogledov: 1307; Prenosov: 21
URL Polno besedilo (0,00 KB)

24.
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: osebi
Ključne besede: graph theory, graphs, cubic graphs, symmetric graphs, ▫$s$▫-regular group, regular covering projection
Objavljeno: 15.10.2013; Ogledov: 1169; Prenosov: 13
URL Polno besedilo (0,00 KB)

25.
Recent trends and future directions in vertex-transitive graphs
Klavdija Kutnar, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade.
Najdeno v: osebi
Ključne besede: matematika, teorija grafov, tranzitivni grafi, poltranzitivni grafi, Hamiltonov cikel, delovanje grupe, polregularna grupa
Objavljeno: 15.10.2013; Ogledov: 1452; Prenosov: 44
URL Polno besedilo (0,00 KB)

26.
Fullerenes via their automorphism groups
Klavdija Kutnar, Dragan Marušič, Dušanka Janežič, 2010, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: matematika, morfologija, avtomorfizem, fulereni
Objavljeno: 15.10.2013; Ogledov: 1623; Prenosov: 11
URL Polno besedilo (0,00 KB)

27.
Classification of half-arc-transitive graphs of order 4p
Klavdija Kutnar, Dragan Marušič, Primož Šparl, Ru-Ji Wang, Ming-Yao Xu, 2013, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: graph
Objavljeno: 15.10.2013; Ogledov: 1129; Prenosov: 10
URL Polno besedilo (0,00 KB)

28.
Classification of edge-transitive rose window graphs
István Kovács, Klavdija Kutnar, Dragan Marušič, 2010, izvirni znanstveni članek

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+r}\} \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 article a complete classification of edge-transitive rose window graphs is given, thus solving one of three open problems about these graphs posed by Steve Wilson in 2001.
Najdeno v: osebi
Ključne besede: group, graph, rose window, vertex-transitive, edge-transitive, arc-transitive
Objavljeno: 15.10.2013; Ogledov: 1253; Prenosov: 38
URL Polno besedilo (0,00 KB)

29.
On cubic non-Cayley vertex-transitive graphs
Klavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: vertex-transitive graph, non-Cayley graph, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1179; Prenosov: 48
URL Polno besedilo (0,00 KB)

30.
An introduction to graph theory
Dragan Marušič, 2006, drugo učno gradivo

Najdeno v: osebi
Ključne besede: graph theory
Objavljeno: 15.10.2013; Ogledov: 1521; Prenosov: 40
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