| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 28
First pagePrevious page123Next pageLast page
1.
ŠOLSKA, CERKVENA IN KULTURNA ZGODOVINA LENDAVE
Aleksandra Horvat, 2009, undergraduate thesis

Abstract: Diplomska seminarska naloga prikazuje šolsko, cerkveno in kulturno zgodovino Lendave. Pri svojem delu sem uporabila deskriptivno, komparativno in zgodovinsko metodo, s katerimi sem opisala najpomembnejše dogodke skozi stoletje. Tisočletna pripadnost Prekmurja k Madžarski je pustila svoje sledove na cerkvenem, šolskem, kulturnem in socialnem področju in je vplivala na samosvoj razvoj le-teh. Šolstvo ima v tem kraju dolgo tradicijo, saj je že v drugi polovici 16. stoletja v takratni Dolnji Lendavi delovala protestantska šola. Sedanja zgradba Dvojezične osnovne šole I Lendava pa je odprla svoja vrata leta 1968. Cerkev ima zametke že v letu 840, saj prvo cerkev v Lendavi omenjajo viri prav v tem letu. Sedanjo cerkev sv. Katarine so dali zgraditi Esterházyjevi v letih od 1749 do 1751. Skozi zgodovino se je podoba cerkve spreminjala, saj so jo morali večkrat obnoviti. Te obnove pa so vplivale tudi na njen baročni stil. O kulturnem življenju na področju lendavske občine pred letom 1945 je ohranjenih izredno malo podatkov. Danes ima Lendava izredno bogato in razvejano društveno dejavnost, saj deluje kar 36 kulturnih, mladinskih in drugih društev, med katerimi imajo nekatera dolgoletno tradicijo. Vsa ta društva pa v veliki meri vplivajo na sedanje družbeno-socialno življenje ljudi. Vsako obdobje je v Lendavi pustilo svoj pečat in na svojstven način vplivalo na razvoj kraja ter na življenje prebivalstva.
Keywords: Prekmurje, Lendava, šolska zgodovina, cerkvena zgodovina, kultura, življenje ljudi.
Published: 27.01.2021; Views: 155; Downloads: 11
.pdf Full text (2,54 MB)

2.
Diskretne strukture
Iztok Peterin, 2020

Abstract: V učbeniku so predstavljene nekatere veje diskretne matematike, ki so še posebej uporabne v računalništvu. Tako se sprehodimo skozi logiko, s posebnim poudarkom na dokazu. Sledijo teorije, pri katerih igra poglavitno vlogo matematična indukcija oziroma bolj splošno induktivna posplošitev. Spoznamo osnove kombinatorike in teorije števil. Predstavljene so rekurzivne relacije, s katerimi lahko opišemo ponavljajoče se procese. To nam omogoča tudi vrednotenje algoritmov glede na čas potreben za njegovo izvedbo. Relacije, ki so podmnožice kartezičnega produkta poljubnih množic, predstavljajo širok vir presenetljivih rezultatov. Eden izmed njih rezultira v mrežah in njihovih posebnih predstavnikih Booleovih algebrah. Končamo z grafi, ki predstavljajo neverjetno uporaben matematični model za simuliranje procesov iz realnega življenja.
Keywords: izjavni račun, indukcija, kombinatorika, rekurzivna relacija, časovna zahtevnost, teorija števil, relacija, mreža, Booleova algebra, graf
Published: 27.10.2020; Views: 270; Downloads: 95
.pdf Full text (5,40 MB)

3.
Hereditarnia 2019
2019, other monographs and other completed works

Abstract: The booklet contains the abstracts of the talks given at the 22th Hereditarnia Workshop on Graph Properties that was held at the Faculty of Electrical Engineering and Computer Science in Maribor on 21st and 22nd of June, 2019. The workshop attracted 22 participants from 8 countries. All of the participants are researchers in di˙erent areas of graph theory, but at this event they all presented topics connected with (hereditary) graph properties. Themes of the talks encompass a wide range of contemporary graph theory research, notably, various types of graph colorings, graph domination, some graph dimensions matchings and graph products. Beside the abstracts of the plenary speaker (Roman Sotak) and three invited speakers (Tanja Gologranc, Michael A. Henning and Ismael G. Yero), the booklet also contains the abstracts of 7 contributed talks given at the event.
Keywords: mathematics, graph theory, Hereditarnia, Maribor, Slovenia
Published: 13.12.2019; Views: 370; Downloads: 123
.pdf Full text (1,08 MB)
This document has many files! More...

4.
Zbirka nalog iz statistike
Aleksandra Tepeh, Gordana Radić, 2019, other educational material

Keywords: statistika, matematična statistika, zbirka nalog, rešene naloge
Published: 19.09.2019; Views: 1902; Downloads: 1661
.pdf Full text (996,08 KB)

5.
Zbirka nalog iz diskretne matematike
Aleksandra Tepeh, Dragana Božović, 2019, other educational material

Keywords: diskretna matematika, matematična statistika, zbirka nalog, rešene naloge
Published: 19.09.2019; Views: 2836; Downloads: 1779
.pdf Full text (497,54 KB)

6.
Diskretna matematika
Aleksandra Tepeh, Riste Škrekovski, 2018, reviewed university, higher education or higher vocational education textbook

Abstract: Učbenik je namenjen študentom visokošolskega študija računalništva in infor- matike. Predstavlja uvod v izbrana poglavja iz matematike, ki so potrebna za razumevanje in reševanje problemov, ki se pojavljajo v računalništvu. Poleg izjavnega računa, relacij in teorije grafov, ki sodijo v področje diskretne matematike, učbenik zajema tudi poglavji o geometrijskih vektorjih in matrikah. Poleg teoretične obravnave snovi učbenik vsebuje veliko zgledov za lažje razumevanje, kakor tudi naloge s postopki in rešitvami.
Keywords: matematika, izjavni račun, matrike, vektorji, relacije, grafi, učbeniki
Published: 12.04.2018; Views: 2973; Downloads: 1279
.pdf Full text (9,41 MB)
This document has many files! More...

7.
Partitioning the vertex set of ▫$G$▫ to make ▫$G \Box H$▫ an efficient open domination graph
Tadeja Kraner Šumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh, 2016, original scientific article

Abstract: A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs ▫$G$▫ for which the Cartesian product ▫$G \Box H$▫ is an efficient open domination graph when ▫$H$▫ is a complete graph of order at least 3 or a complete bipartite graph. The characterization is based on the existence of a certain type of weak partition of ▫$V(G)$▫. For the class of trees when ▫$H$▫ is complete of order at least 3, the characterization is constructive. In addition, a special type of efficient open domination graph is characterized among Cartesian products ▫$G \Box H$▫ when ▫$H$▫ is a 5-cycle or a 4-cycle.
Keywords: efficient open domination, Cartesian product, vertex labeling, total domination
Published: 10.07.2017; Views: 435; Downloads: 81
.pdf Full text (166,60 KB)
This document has many files! More...

8.
The periphery graph of a median graph
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh, 2010, original scientific article

Abstract: The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are path-like median graphs with arbitrarily large geodetic number. Peripheral expansion with respect to periphery graph is also considered, and connections with the concept of crossing graph are established.
Keywords: mathematics, graph theory, median graph, Cartesian product, geodesic, periphery, peripheral expansion
Published: 31.03.2017; Views: 844; Downloads: 308
.pdf Full text (145,86 KB)
This document has many files! More...

9.
On acyclic colorings of direct products
Simon Špacapan, Aleksandra Tepeh, 2008, original scientific article

Abstract: A coloring of a graph ▫$G$▫ is an acyclic coloring if the union of any two color classes induces a forest. It is proved that the acyclic chromatic number of direct product of two trees ▫$T_1$▫ and ▫$T_2$▫ equals ▫$\min\{ \Delta(T_1) + 1, \Delta(T_2) + 1\}$▫. We also prove that the acyclic chromatic number of direct product of two complete graphs ▫$K_m$▫ and ▫$K_n$▫ is ▫$mn-m-2$▫, where ▫$m \ge n \ge 4$▫. Several bounds for the acyclic chromatic number of direct products are given and in connection to this some questions are raised.
Keywords: mathematics, graph theory, coloring, acyclic coloring, distance-two coloring, direct product
Published: 31.03.2017; Views: 388; Downloads: 62
.pdf Full text (142,13 KB)
This document has many files! More...

10.
Search done in 0.25 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica