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 - 10 / 222
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
1.
2.
Sodelovanje med šolo in krajem : magistrsko delo
Sara Hrvatin, 2023, magistrsko delo

Ključne besede: sodelovanje šole in kraja, partnerstvo, OŠ Ivana Babiča-Jagra Marezige, skupnost, vaška šola
Objavljeno v RUP: 11.01.2024; Ogledov: 194; Prenosov: 13
.pdf Celotno besedilo (3,90 MB)

3.
4.
5.
6.
7.
Razredna klima in učna uspešnost učencev : diplomsko delo
Sara Zupan, 2023, diplomsko delo

Ključne besede: razredna klima, učna uspešnost, dejavniki učne uspešnosti, učenci, učitelji
Objavljeno v RUP: 16.11.2023; Ogledov: 285; Prenosov: 10
.pdf Celotno besedilo (1004,93 KB)

8.
9.
The Sierpiński product of graphs
Jurij Kovič, Tomaž Pisanski, Sara Sabrina Zemljič, Arjana Žitnik, 2023, izvirni znanstveni članek

Opis: In this paper we introduce a product-like operation that generalizes the construction of the generalized Sierpiński graphs. Let ▫$G, \, H$▫ be graphs and let ▫$f: V(G) \to V(H)$▫ be a function. Then the Sierpiński product of graphs ▫$G$▫ and ▫$H$▫ with respect to ▫$f$▫, denoted by ▫$G\otimes_f H$▫, is defined as the graph on the vertex set ▫$V(G) \times V(H)$▫, consisting of ▫$|V(G)|$▫ copies of ▫$H$▫; for every edge ▫$\{g, g'\}$▫ of ▫$G▫$ there is an edge between copies ▫$gH$▫ and ▫$g'H$▫ of form ▫$\{(g, f(g'), (g', f(g))\}$▫. Some basic properties of the Sierpiński product are presented. In particular, we show that the graph ▫$G\otimes_f H$▫ is connected if and only if both graphs ▫$G$▫ and ▫$H$▫ are connected and we present some conditions that ▫$G, \, H$▫ must fulfill for ▫$G\otimes_f H$▫ to be planar. As for symmetry properties, we show which automorphisms of ▫$G$▫ and ▫$H$▫ extend to automorphisms of ▫$G\otimes_f H$▫. In several cases we can also describe the whole automorphism group of the graph ▫$G\otimes_f H$▫. Finally, we show how to extend the Sierpiński product to multiple factors in a natural way. By applying this operation ▫$n$▫ times to the same graph we obtain an alternative approach to the well-known ▫$n$▫-th generalized Sierpiński graph.
Ključne besede: Sierpiński graphs, graph products, connectivity, planarity, symmetry
Objavljeno v RUP: 06.11.2023; Ogledov: 253; Prenosov: 3
.pdf Celotno besedilo (526,44 KB)

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