| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


231 - 240 / 311
Na začetekNa prejšnjo stran20212223242526272829Na naslednjo stranNa konec
231.
Domination game: extremal families of graphs for 3/5-conjectures
Boštjan Brešar, Sandi Klavžar, Gašper Košmrlj, Douglas F. Rall, 2013, izvirni znanstveni članek

Opis: Igralca, Dominator in Zavlačevalka, izmenoma izbirata vozlišča grafa ▫$G$▫, takoda vsako izbrano vozlišče poveča množico do sedaj dominiranih vozlišč. Cilj Dominatorja je končati igro čim hitreje, medtem ko je Zavlačevalkin cilj ravno nasprotno. Igralno dominacijsko število ▫$gamma_g(G)$▫ je skupno število izbranih vozlišč v igri, ko Dominator naredi prvo potezo in oba igralca igrata optimalno. Postavljena je bila domneva [W.B. Kinnersley, D.B. West, R. Zemani, Extremal problems for game domination number, Manuscript, 2012], da velja ▫$gamma_g(G) leq frac{3|V(G)|}{5}$▫ za poljuben graf ▫$G$▫ brez izoliranih vozlišč. V posebnem je domneva odprta tudi, ko je ▫$G$▫ gozd. V tem članku predstavimo konstrukcije, ki nam dajo velike družine dreves, ki dosežejo domnevno mejo ▫$3/5$▫. Leplenje dreves iz nekaterih izmed teh družin napoljuben graf nam da konstrukcijo grafov ▫$G$▫, ki imajo igralno dominacijsko število enako ▫$3|V(G)|/5$▫. Z računalnikom smo poiskali vsa ekstremna drevesa znajveč 20 vozlišči. V posebnem, na 20 vozliščih obstaja natanko deset dreves ▫$T$▫, za katere velja ▫$gamma_g(T) = 12$▫, in vsa pripadajo skonstruiranim družinam.
Ključne besede: matematika, teorija grafov, dominacijska igra, igralno dominacijsko številko, 3/5-domneva, računalniško iskanje, mathematics, graph theory, domination game, game domination number, 3/5-conjecture, computer search
Objavljeno: 10.07.2015; Ogledov: 466; Prenosov: 48
URL Povezava na celotno besedilo

232.
Crossing number additivity over edge cuts
Drago Bokal, Markus Chimani, Jesús Leanõs, 2013, izvirni znanstveni članek

Opis: Consider a graph ▫$G$▫ with a minimal edge cut ▫$F$▫ and let ▫$G_1$▫, ▫$G_2$▫ be the two (augmented) components of ▫$G-F$▫. A long-open question asks under which conditions the crossing number of ▫$G$▫ is (greater than or) equal to the sum ofcthe crossing numbers of ▫$G_1$▫ and ▫$G_2$▫ - which would allow us to consider those graphs separately. It is known that crossing number is additive for ▫$|F| in {0,1,2}$▫ and that there exist graphs violating this property with ▫$|F| ge 4$▫. In this paper, we show that crossing number is additive for ▫$|F|=3$▫, thus closing the final gap in the question. The techniques generalize to show that minor crossing number is additive over edge cuts of arbitrary size, as well as to provide bounds for crossing number additivity in arbitrary surfaces. We point out several applications to exact crossing number computation and crossing-critical graphs, as well as provide a very general lower bound for the minor crossing number of the Cartesian product of an arbitrary graph with a tree.
Ključne besede: matematika, teorija grafov, prekrižno število, minor, mathematics, graph theory, crossing number, minor
Objavljeno: 10.07.2015; Ogledov: 423; Prenosov: 43
URL Povezava na celotno besedilo

233.
Intervals and convex sets in strong product of graphs
Iztok Peterin, 2013, izvirni znanstveni članek

Opis: Obravnavamo intervale in konveksne množice krepkega produkta. Vozlišča poljubnega intervala iz ▫$G boxtimes H$▫ so klasificirana z najkrajšimi potmi v enem faktorju in s sprehodi v dugem rahlo modificiranem faktorju. Konveksne množice krepkega produkta so karakterizirane s konveksnostjo obeh projekcij in še tremi lokalnimi lastnostmi, med katerimi je tudi 2-konveksnost.
Ključne besede: teorija grafov, krepki produkt, geodetska konveksnost, interval, graph theory, strong product, geodesic convexity, interval
Objavljeno: 10.07.2015; Ogledov: 281; Prenosov: 55
URL Povezava na celotno besedilo

234.
A characterization of the edge connectivity of direct products of graphs
Simon Špacapan, 2013, izvirni znanstveni članek

Opis: V članku dokažemo formulo za povezanost po povezavah direktnega produkta grafov. V formuli se povezanost po povezavah produkta izraža kot funkcija povezanosti po povezavah, najmanjše stopnje, števila povezav in dvodelne frustracije obeh faktorjev. Prav tako v članku opišemo strukturo najmanjših presečnih množic v direktnih produktih grafov.
Ključne besede: matematika, teorija grafov, direktni produkt, povezanost po povezavah, mathematics, graph theory, direct product, edge connectivity
Objavljeno: 10.07.2015; Ogledov: 342; Prenosov: 50
URL Povezava na celotno besedilo

235.
A note on the chromatic number of the square of the Cartesian product of two cycles
Zehui Shao, Aleksander Vesel, 2013, kratki znanstveni prispevek

Opis: The square ▫$G^2$▫ of a graph ▫$G$▫ is obtained from ▫$G$▫ by adding edges joining all pairs of nodes at distance 2 in ▫$G$▫. In this note we prove that ▫$chi((C_mBox C_n)^2) le 6$ for $m, n ge 40$▫. This confirms Conjecture 19 stated in [É. Sopena, J. Wu, Coloring the square of the Cartesian product of two cycles, Discrete Math. 310 (2010) 2327-2333].
Ključne besede: matematika, teorija grafov, kromatično število, kartezični produkt, označevanje grafov, kvadrat grafa, mathematics, graph theory, chromatic number, Cartesian product, graph labeling, square if a graph
Objavljeno: 10.07.2015; Ogledov: 486; Prenosov: 43
URL Povezava na celotno besedilo

236.
On the vertex k-path cover
Boštjan Brešar, Marko Jakovac, Ján Katrenič, Gabriel Semanišin, Andrej Taranenko, 2013, izvirni znanstveni članek

Opis: A subset ▫$S$▫ of vertices of a graph ▫$G$▫ is called a vertex ▫$k$▫-path cover if every path of order ▫$k$▫ in ▫$G$▫ contains at least one vertex from ▫$S$▫. Denote by ▫$psi_k(G)$▫ the minimum cardinality of a vertex ▫$k$▫-path cover in ▫$G$▫. In this paper, an upper bound for ▫$psi_3$▫ in graphs with a given average degree is presented. A lower bound for ▫$psi_k$▫ of regular graphs is also proven. For grids, i.e. the Cartesian products of two paths, we give an asymptotically tight bound for ▫$psi_k$▫ and the exact value for ▫$psi_3$▫.
Ključne besede: matematika, teorija grafov, vozliščno pokritje, regularni grafi, mreže, mathematics, graph theory, vertex cover, grids
Objavljeno: 10.07.2015; Ogledov: 379; Prenosov: 8
URL Povezava na celotno besedilo

237.
238.
239.
Stylistic comparison of the original and Slovene translation of Douglas Adams's The Hitchhiker's Guide to the Galaxy
Jure Cehner, 2015, diplomsko delo

Opis: An author's style can sometimes be as important as the content itself. One could argue it is one of the fundamental components in fiction, and it can make or break a good book. However, as much as we enjoy it, it can be hard to define. We know it is present and it can make us feel a range of emotions, but what causes the emotions on a linguistic level is not easily answered. Douglas Adams’ novel The Hitchhiker’s Guide to the Galaxy is a mixture of science fiction and comedy. Comedic effect is prevalent throughout the book and is achieved by several linguistic devices. The optimal way to study one’s writing style is to break it down in to smaller components, and in the case of this thesis to proper names, nonce words and several figures of speech. Alojz Kodre, the Slovene translator of the book, holds a Master’s degree in Physics, therefore I assumed he was more capable of bringing the astronomical concepts and technical jargon to the Slovene reader than a translator with no knowledge of astrophysics. The purpose of my thesis was also to find out whether he had been successful at not only accurately conveying meaning but also Adams’s unique style. Not taking into account his many stylistic elements can be detrimental for the overall reading experience. The discrepancies were highlighted with skopos theory as a basis for adequacy of translations methods, both used or methods that could have been used. The skopos theory helps the translator achieve the purpose of the translation usually defined by the target audience. It is a universal theory, but I was interested whether skopos theory can be applied to style as well. The translation must serve the readership of the target culture, but the author’s style, especially if prominent such as Adams’s, should not be put in second place. To some extent the translator also needs to be faithful to the author, but where does he need to draw the line? Occasionally, one factor needs to be sacrificed; whether the author’s style for the sake of understandability or the understandability for the sake of style. Alojz Kodre seemed to favour purpose over form; sometimes for clear reasons, because preserving the author’s style would have made the translation less comprehendible, and sometimes for less obvious reasons. It is evident that the artistic aspect of the novel was not the translator’s primary concern. He, however, had very little problems with conveying the intended meaning to the target readership.
Ključne besede: style, proper nouns, nonce words, figures of speech, translation methods, skopos theory, stylistic comparison
Objavljeno: 15.02.2016; Ogledov: 846; Prenosov: 85
.pdf Celotno besedilo (1,05 MB)

240.
Management competencies and organizational performance in CEE
Petra Šparl, Anja Žnidaršič, Helmut Kasper, Jürgen Mühlbacher, Jure Kovač, 2013, izvirni znanstveni članek

Opis: Today management competencies are seen as the only long-term strategic advantage of any company. However, from corporate experience we know that only 10 % of the knowledge acquired is transferred into entrepreneurial practice. Current trends in management development often overemphasize individual learning and ignore the missing fit between individual behavior and organizational performance. To meet these demands, we collected competency attributions of managers attending executive courses in Austria and Slovenia. A questionnaire with closed and open question will help to explore and compare the relation between organizational performance and current management competencies in these countries. The results confirm our predictions to a lesser extent. However, they represent a basis for further examination of the relationship between managerial competencies and organizational performance.
Ključne besede: classes of competencies, competency-based theory, competency management
Objavljeno: 30.12.2015; Ogledov: 398; Prenosov: 26
.pdf Celotno besedilo (324,22 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.25 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici