Lupa

Search the repository Help

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

Options:
  Reset


1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
The equalization scheme of the residual voluntary health insurance in Slovenia
Boris Zgrablić, 2015, original scientific article

Abstract: Residual voluntary health insurance in Slovenia covers the difference between the (recognised) value of the health service and the part of this value that is payed by the compulsory health insurance. From the inception of compulsory health insurance in 1992, residual voluntary health insurance has open enrolment. From 2006 community rating applied, as well as an equalization scheme with which the differences in health services expenses, arising from the different structures of the insurees of the single insurance undertakings regarding age and gender, shall be equalized. The equalization scheme of the residual voluntary health insurance in Slovenia is presented, along with a detailed explanation of the formulae required for the computation.
Found in: osebi
Keywords: residual voluntary health insurance, equalization scheme, claims equalization, risk equalization
Published: 15.10.2015; Views: 2413; Downloads: 134
.pdf Full text (210,01 KB)
This document has more files! More...

2.
Reachability relations in digraphs
Norbert Seifter, Dragan Marušič, Aleksander Malnič, Primož Šparl, Boris Zgrablić, 2008, original scientific article

Abstract: 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.
Found in: osebi
Keywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Published: 03.04.2017; Views: 2133; Downloads: 129
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