1. Coverings of general digraphsAleksander Malnič, Boris Zgrablić, 2025, izvirni znanstveni članek Opis: A unified theory of covering projections of graphs and digraphs is presented as one theory by considering coverings of general digraphs, where multiple directed and undirected edges together with oriented and unoriented loops and semiedges, are allowed. It transpires that coverings of general digraphs can display certain pathological behaviour since the naturally defined projections of their underlying graphs may not be coverings in the usual topological sense. Consequently, homotopy does not always lift, although the unique walk lifting property still holds. Yet, it is still possible to grasp such coverings algebraically in terms of the action of the fundamental monoid. This action is permutational and has certain nice properties that monoid actions in general do not have. As a consequence, such projections can be studied combinatorially in terms of voltages. The problem of isomorphism and equivalence, and in particular, the problem of lifting automorphisms, is treated in depth. All known results about covering projections of graphs are simple corollaries of just three general theorems.
Ključne besede: mixed graph, general digraph, dart, covering projection, voltage, homotopy, monoid action, lifting automorphisms
Objavljeno v RUP: 10.09.2025; Ogledov: 329; Prenosov: 17
 Celotno besedilo (569,42 KB) |
2. Reachability relations in digraphsAleksander 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: 03.04.2017; Ogledov: 4100; Prenosov: 145
 Povezava na celotno besedilo |
3. The equalization scheme of the residual voluntary health insurance in SloveniaBoris Zgrablić, 2015, izvirni znanstveni članek Opis: 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.
Ključne besede: residual voluntary health insurance, equalization scheme, claims equalization, risk equalization
Objavljeno v RUP: 15.10.2015; Ogledov: 5097; Prenosov: 153
Celotno besedilo (210,01 KB) |
