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 / 23
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
Aggregate production function of the Slovenian economy : bachelor thesis
Elena Cvetanoska, 2024, diplomsko delo

Ključne besede: production function, economic growth, productivity, Slovenia, economic policy
Objavljeno v RUP: 22.07.2024; Ogledov: 320; Prenosov: 18
.pdf Celotno besedilo (950,29 KB)

2.
China and The European Union : An assessment of interregional trade potential
Sladjana Ilić, 2021, magistrsko delo

Ključne besede: trade, economy, growth, European Union, China
Objavljeno v RUP: 02.02.2022; Ogledov: 1309; Prenosov: 46
.pdf Celotno besedilo (1,39 MB)

3.
4.
5.
6.
7.
8.
9.
Comparative analysis of tourism-led growth in Slovenia and Montenegro
Sergej Gričar, Štefan Bojnec, Vesna Karadžić, Svetlana Rakočević, 2016, izvirni znanstveni članek

Ključne besede: Slovenia, Montenegro, causality, tourism, economic growth
Objavljeno v RUP: 02.04.2017; Ogledov: 3512; Prenosov: 85
.pdf Celotno besedilo (160,75 KB)

10.
Reachability relations in digraphs
Aleksander Malnič, Dragan Marušič, Norbert Seifter, Primož Šparl, Boris Zgrablić, 2008, izvirni znanstveni članek

Opis: In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.
Ključne besede: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Objavljeno v RUP: 02.04.2017; Ogledov: 3109; Prenosov: 136
URL Povezava na celotno besedilo

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