Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 10 / 12
First pagePrevious page12Next pageLast page
1.
U službi države, na službu građanima
Zdravka Jelaska, 2008, original scientific article

Found in: ključnih besedah
Summary of found: ...notariat, zgodovina, pravo, Split, Dalmacija, 1918-1944, ...
Keywords: notariat, zgodovina, pravo, Split, Dalmacija, 1918-1944
Published: 10.07.2015; Views: 946; Downloads: 13
URL Full text (0,00 KB)

2.
Obitelj dalmatinskog plemstva od 12. do 14. stoljeća
Zrinka Nikolić Jakus, 2008, original scientific article

Abstract: 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.
Found in: ključnih besedah
Summary of found: ...biggest Dalmatian cities - Zadar, Trogir, and Split. The changes first appearedin Zadar. They appeared...
Keywords: plemstvo, mesta, mestno plemstvo, Dalmacija, Zadar, Trogir, Split, družina, srednji vek
Published: 10.07.2015; Views: 1074; Downloads: 17
URL Full text (0,00 KB)

3.
Connected graphs of fixed order and size with minimal index
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2004, original scientific article

Found in: ključnih besedah
Summary of found: ...largest eingenvalue, spectral radius, graph index, nested split graphs, ...
Keywords: spekter grafa, največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index, nested split graphs
Published: 15.10.2015; Views: 1273; Downloads: 20
URL Full text (0,00 KB)

4.
Vector connectivity in graphs
Ferdinando Cicalese, Martin Milanič, Pinar Heggernes, Endre Boros, Pim Van 't Hof, Romeo Rizzi, 2014, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees, ...
Keywords: 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
Published: 15.10.2015; Views: 1355; Downloads: 102
URL Full text (0,00 KB)
This document has more files! More...

5.
On spectral radius and energy of complete multipartite graphs
Ivan Gutman, Dragan Stevanović, Masood U. Rehman, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...radius, complete multipartite graph, graph energy, complete split graph, Turan graph, ...
Keywords: spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph
Published: 15.10.2015; Views: 1096; Downloads: 67
URL Full text (0,00 KB)

6.
On distance integral graphs
Dragan Stevanović, Marko Milošević, Milan Pokorný, Pavel Híc, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...distance spectrum, distance integral graph, tree, complete split graph, ...
Keywords: distance spectrum, distance integral graph, tree, complete split graph
Published: 03.04.2017; Views: 821; Downloads: 89
URL Full text (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, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, conflict-free matrix, conflict-free row split, row-conflict graph, ...
Keywords: perfect phylogeny, conflict-free matrix, conflict-free row split, row-conflict graph
Published: 08.08.2016; Views: 1167; Downloads: 56
URL Full text (0,00 KB)

8.
The minimum conflict-free row split problem revisited
Alexandru I. Tomescu, Romeo Rizzi, Martin Milanič, Edin Husić, Ademir Hujdurović, 2016, published scientific conference contribution

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published: 14.11.2017; Views: 779; Downloads: 181
URL Full text (0,00 KB)
This document has more files! More...

9.
On split liftings with sectional complements
Aleksander Malnič, Rok Požar, 2018, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: algorithm, Cayley voltages, covering projection, graph, group presentation, invariant section, lifting automorphisms, linear systems over the integers, split extension
Published: 02.03.2018; Views: 580; Downloads: 95
URL Full text (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, original scientific article

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published: 08.05.2018; Views: 654; Downloads: 84
URL Full text (0,00 KB)

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