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 / 12
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
U službi države, na službu građanima
Zdravka Jelaska, 2008, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...notariat, zgodovina, pravo, Split, Dalmacija, 1918-1944, ...
Ključne besede: notariat, zgodovina, pravo, Split, Dalmacija, 1918-1944
Objavljeno: 10.07.2015; Ogledov: 918; Prenosov: 12
URL Polno besedilo (0,00 KB)

2.
Obitelj dalmatinskog plemstva od 12. do 14. stoljeća
Zrinka Nikolić Jakus, 2008, izvirni znanstveni članek

Opis: In the period from the twelfth until the fourteenth century the Dalmatian noble family gradually was established as a patrilineal lineage. In the article this process is studied especially on the example of the three biggest Dalmatian cities - Zadar, Trogir, and Split. The changes first appearedin Zadar. They appeared relatively late in the terminology connected with family - at the end of the thirteenth century - and they are best seen in the change of status of daughters in relations to family inheritance. Although by Roman law they had rights to equal shares in the whole property - including estates and houses - just the same as their brothers, during the thirteenth century the right of inheritance after the death of the parents was gradually replaced by a pay-off of shares of inheritance in the dowry at the time of marriage. First, the payment of inheritance in money in the dowry was preferred when girls married foreigners from distant cities. This new custom appeared first in Zadar because it had a more developed economy, making monetary payments easier. The practice of giving estates in dowries was retained longer in Trogir and Split. Patronage rights were never denied to female descendants. Finally, in fourteenth-century Zadar, payment of dowries in cash became a way to deny sisters an equal share in inheritance with brothers, because dowries fell short of equal shares of the inheritance. That patrilineal lineage was getting stronger is also illustrated by the adoption of family names. It is significant that family names that derived from the name of ancestors appeared later, while the first family names derived from nicknames. In this process Zadar was also ahead of other cities. In spite of the attenuated process of the establishment of the patrilineal family, the importance of cognatic and affinial ties were continuously recognised in private and public life whether in legal attempts to prevent the uniting of cousins in governmental bodies or in the obligation of cognates to take part in the defense of family honor and feuds. In this way, both types of family - cognatic and agnatic - had an important role in the circles of Dalmatian nobility.
Najdeno v: ključnih besedah
Povzetek najdenega: ...biggest Dalmatian cities - Zadar, Trogir, and Split. The changes first appearedin Zadar. They appeared...
Ključne besede: plemstvo, mesta, mestno plemstvo, Dalmacija, Zadar, Trogir, Split, družina, srednji vek
Objavljeno: 10.07.2015; Ogledov: 1015; Prenosov: 16
URL Polno besedilo (0,00 KB)

3.
Connected graphs of fixed order and size with minimal index
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2004, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...largest eingenvalue, spectral radius, graph index, nested split graphs, ...
Ključne besede: spekter grafa, največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index, nested split graphs
Objavljeno: 15.10.2015; Ogledov: 951; Prenosov: 19
URL Polno besedilo (0,00 KB)

4.
Vector connectivity in graphs
Ferdinando Cicalese, Martin Milanič, Pinar Heggernes, Endre Boros, Pim Van 't Hof, Romeo Rizzi, 2014, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Povzetek najdenega: ...approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees, ...
Ključne besede: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees
Objavljeno: 15.10.2015; Ogledov: 1250; Prenosov: 91
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

5.
On spectral radius and energy of complete multipartite graphs
Ivan Gutman, Dragan Stevanović, Masood U. Rehman, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...radius, complete multipartite graph, graph energy, complete split graph, Turan graph, ...
Ključne besede: spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph
Objavljeno: 15.10.2015; Ogledov: 1030; Prenosov: 58
URL Polno besedilo (0,00 KB)

6.
On distance integral graphs
Dragan Stevanović, Marko Milošević, Milan Pokorný, Pavel Híc, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...distance spectrum, distance integral graph, tree, complete split graph, ...
Ključne besede: distance spectrum, distance integral graph, tree, complete split graph
Objavljeno: 03.04.2017; Ogledov: 751; Prenosov: 80
URL Polno besedilo (0,00 KB)

7.
Finding a perfect phylogeny from mixed tumor samples
Ademir Hujdurović, Urša Kačar, Martin Milanič, Bernard Ries, Alexandru I. Tomescu, 2015, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...perfect phylogeny, conflict-free matrix, conflict-free row split, row-conflict graph, ...
Ključne besede: perfect phylogeny, conflict-free matrix, conflict-free row split, row-conflict graph
Objavljeno: 08.08.2016; Ogledov: 1092; Prenosov: 51
URL Polno besedilo (0,00 KB)

8.
The minimum conflict-free row split problem revisited
Alexandru I. Tomescu, Romeo Rizzi, Martin Milanič, Edin Husić, Ademir Hujdurović, 2016, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Objavljeno: 14.11.2017; Ogledov: 692; Prenosov: 158
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

9.
On split liftings with sectional complements
Aleksander Malnič, Rok Požar, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: algorithm, Cayley voltages, covering projection, graph, group presentation, invariant section, lifting automorphisms, linear systems over the integers, split extension
Objavljeno: 02.03.2018; Ogledov: 509; Prenosov: 85
URL Polno besedilo (0,00 KB)

10.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's...
Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Objavljeno: 08.05.2018; Ogledov: 584; Prenosov: 74
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