Search the repository

A+ | A- | | SLO | ENG

Abstract: Delo podaja konceptualizacijo fenomena pričevanja, ki je oprta na filozofske nastavke njegove obravnave pri Heideggru, Gadamerju, Arendtovi, Ricoeurju, Derridaju in Agambenu. Manca Erzetič teoretsko raven premisleka pričevanja ob tem sooči s širšo tematiko izpričevanja zgodovinske situacijo 20. stoletja, predvsem kar zadeva izkušnjo totalitarističnega nasilja. Primo Levi kot pričevalec Auschwitza jo je strnil v reklo Ali je to človek. Za njegovo polno razumevanje je po avtoričinem vpogledu potrebno vzeti v zakup še zgodovinsko okoliščino Auschwitza po Auschwitzu. V drugem delu knjige tako sledi obravnava različnih možnosti izpričevanja človeškosti, skupaj z njegovo nemožnostjo ali prepovedjo, kakor je, recimo doletela žrtve Golega otoka. Refleksija literarnega vidika pričevanja, ki vključuje pesnike, kot so Srečko Kosovel, Niko Grafenauer in Boris A. Novak, je posebej obeležena v neposrednem pričevanjskem razgovoru Mance Erzetič z Borisom Pahorjem, osrednjim slovenskim pričevalcem 20. stoletja. Prav pričevanjska izkušnja Borisa Pahorja, ki je vseskozi zaznamovana z grožnjo odtegnitve domovinskosti, omogoči uvid, da ni eksistencialno ranljiv le posameznik po svojih življenjskih situacijah, pač pa je vselej zgodovinsko ranljiv tudi svet, v katerem je človeku biti. Eksistencialno določilo biti-priča, ki ga je potrebno pojmovno razločiti od faktične pozicije pričevalca, kakor tudi od aktualizacije izpričevanja, tako zasnavlja smiselne horizonte zgodovinskega dogajanja, ki bi sicer ostali nerazpoznavni.
Keywords: osebna pričevanja, pričevanje, izpričevanje, hermenevtika pričevanja, jaz, doživljanje, osebnost, čas, eksistencialna situacija, zgodovinsko izkustvo, spomin, bit, smisel, jezikovni izraz, avtobiografska književnost, pričevanjska literatura, totalitaritem, koncentracijska taborišča
Published in DiRROS: 14.04.2025; Views: 94; Downloads: 19
Full text (7,62 MB)

Abstract: An independent coalition in a graph $G$ consists of two disjoint, independent vertex sets $V_1$ and $V_2$, such that neither $V_1$ nor $V_2$ is a dominating set, but the union $V_1\cup V_2$ is an independent dominating set of $G$. An independent coalition partition of $G$ is a partition $\{V_1, \ldots, V_k\}$ of $V(G)$ such that for every $i\in [k]$, either the set $V_i$ consists of a single dominating vertex of $G$, or $V_i$ forms an independent coalition with some other part $V_j$. The independent coalition number $IC(G)$ of $G$ is the maximum order of an independent coalition of $G$. The independent coalition graph ${\rm ICG}(G,\pi)$ of $\pi=\{V_1, \ldots, V_k\}$ (and of $G$) has the vertex set $\{V_1,\ldots, V_k\}$, vertices $V_i$ and $V_j$ being adjacent if $V_i$ and $V_j$ form an independent coalition in $G$. In this paper, a large family of graphs with $IC(G) = 0$ is described and graphs $G$ with $IC(G)\in \{n(G), n(G)-1\}$ characterized. Some properties of ${\rm ICG}(G,\pi)$ are presented. The independent coalition graphs of paths are characterized, and the independent coalition graphs of cycles described.
Keywords: dominating set, independent set, independent coalition, independent coalition number, independent coalition graphs
Published in DiRROS: 11.04.2025; Views: 105; Downloads: 54
Full text (157,79 KB)
This document has many files! More...

Published in DiRROS: 11.04.2025; Views: 108; Downloads: 54
Full text (3,95 MB)
This document has many files! More...

Abstract: A subset $S$ of vertices of a graph $G$ is a general position set if no shortest path in $G$ contains three or more vertices of $S$. In this paper, we generalise a problem of M. Gardner to graph theory by introducing the lower general position number ${\rm gp}^-(G)$ of $G$, which is the number of vertices in a smallest maximal general position set of $G$. We show that ${\rm gp}^-(G) = 2$ if and only if $G$ contains a universal line and determine this number for several classes of graphs, including Kneser graphs $K(n,2)$, line graphs of complete graphs, and Cartesian and direct products of two complete graphs. We also prove several realisation results involving the lower general position number, the general position number and the geodetic number, and compare it with the lower version of the monophonic position number. We provide a sharp upper bound on the size of graphs with given lower general position number. Finally we demonstrate that the decision version of the lower general position problem is NP-complete.
Keywords: general position number, geodetic number, universal line, computational complexity, Kneser graphs, line graphs
Published in DiRROS: 11.04.2025; Views: 106; Downloads: 52
Full text (254,31 KB)
This document has many files! More...

Keywords: cemented carbide, fracture analysis, stone cutting inserts, chainsaw machine
Published in DiRROS: 11.04.2025; Views: 108; Downloads: 51
Full text (3,18 MB)
This document has many files! More...