61. Reachability relations in digraphsAleksander Malnič, Dragan Marušič, Norbert Seifter, 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.
Keywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Published in RUP: 03.04.2017; Views: 2775; Downloads: 133
 Link to full text |
62. Trst leta 1945 : primerjava poročanja lokalnih časopisovBoris Ugrin, 2016, undergraduate thesis Keywords: tržaška časopisna krajina, javno mnenje, politične stranke, družbeni sistem, ozemeljsko vprašanje, Trst, lokalni časopisi, 1945, zgodovina, diplomska dela
Published in RUP: 10.11.2016; Views: 2764; Downloads: 83
 Full text (916,56 KB) |
63. |
64. |
65. |
66. Mjesta susretanja : professional monographMartina Blečić Kavur, Adnan Busuladžić, Wolfgang David, Zrinka Ettinger Starčić, Mitja Guštin, Boris Kavur, 2014, professional monograph Keywords: urbana naselja, Evropa, stari vek, arheološke najdbe
Published in RUP: 21.12.2015; Views: 3176; Downloads: 46
Full text (5,71 MB) |
67. |
68. |
69. |
70. |
