Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


Iskanje brez iskalnega niza vrača največ 100 zadetkov!

81 - 90 / 100
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
81.
Ali in koliko poznamo izbrane neologizme, pozabnice in igre besed : Raziskovalna naloga pri predmetu Pomenoslovje in besedotvorje
Teja Breznik, Anika Černigoj, Anja Kolar, Ana Rihar, Ana Soldat, Meta Stergar, Maša Zidar, Tanja Žuvela, drugo učno gradivo

Opis: V raziskovalni nalogi so združene seminarske naloge, ki so jih študentke opravljale pri predmetu Pomenoslovje in besedotvorje. Z anketami so preverjale, ali sodelujoči poznajo in uporabljajo izbrane izraze in ali predlagajo drugačna poimenovanja. Analiza je zajemala tri skupine izrazov – neologizme, pozabnice in besedne igre.
Ključne besede: pomenoslovje, besedotvorje, pozabnice, neologizmi, igre besed
Objavljeno v RUP: 10.01.2022; Ogledov: 1322; Prenosov: 54
.pdf Celotno besedilo (806,46 KB)

82.
Some remarks on Balaban and sum-Balaban index
Martin Knor, Jozef Komorník, Riste Škrekovski, Aleksandra Tepeh, 2020, izvirni znanstveni članek

Opis: In the paper we study maximal values of Balaban and sum-Balaban index, and correct some results appearing in the literature which are only partially correct. Henceforth, we were able to solve a conjecture of M. Aouchiche, G. Caporossi and P. Hansen regarding the comparison of Balaban and Randić index. In addition, we showed that for every k and large enough n, the first k graphs of order n with the largest value of Balaban index are trees. We conclude the paper with a result about the accumulation points of sum-Balaban index.
Ključne besede: topological index, Balaban index, sum-Balaban index, Randić index
Objavljeno v RUP: 03.01.2022; Ogledov: 1012; Prenosov: 21
.pdf Celotno besedilo (310,27 KB)

83.
Regular antilattices
Karin Cvetko-Vah, Michael Kinyon, Jonathan Leech, Tomaž Pisanski, 2019, izvirni znanstveni članek

Opis: Antilattices ▫$(S; \vee, \wedge)$▫ for which the Green's equivalences ▫$\mathcal{L}_{(\vee)}$▫, ▫$\mathcal{R}_{(\vee)}$▫, ▫$\mathcal{L}_{(\wedge)}$▫ and ▫$\mathcal{R}_{(\wedge)}$▫ are all congruences of the entire antilattice are studied and enumerated.
Ključne besede: noncommutative lattice, antilattice, Green's equivalences, lattice of subvarieties, enumeration, partition, composition
Objavljeno v RUP: 03.01.2022; Ogledov: 1101; Prenosov: 16
.pdf Celotno besedilo (308,07 KB)

84.
On a conjecture about the ratio of Wiener index in iterated line graphs
Katarína Hriňáková, Martin Knor, Riste Škrekovski, 2018, izvirni znanstveni članek

Ključne besede: Wiener index, line graph, tree, iterated line graph
Objavljeno v RUP: 03.01.2022; Ogledov: 1169; Prenosov: 28
.pdf Celotno besedilo (391,35 KB)

85.
Divergence zero quaternionic vector fields and Hamming graphs
Jasna Prezelj, Fabio Vlacci, 2020, izvirni znanstveni članek

Opis: We give a possible extension of the definition of quaternionic power series, partial derivatives and vector fields in the case of two (and then several) non commutative (quaternionic) variables. In this setting we also investigate the problem of describing zero functions which are not null functions in the formal sense. A connection between an analytic condition and a graph theoretic property of a subgraph of a Hamming graph is shown, namely the condition that polynomial vector field has formal divergence zero is equivalent to connectedness of subgraphs of Hamming graphs ▫$H(d, 2)$▫. We prove that monomials in variables ▫$z$▫ and ▫$w$▫ are always linearly independent as functions only in bidegrees ▫$(p, 0)$▫, ▫$(p, 1)$▫, ▫$(0, q)$▫, ▫$(1, q)$▫ and ▫$(2, 2)$▫.
Ključne besede: quaternionic power series, bidegree full functions, Hamming graph, linearly independent quaternionic monomials
Objavljeno v RUP: 03.01.2022; Ogledov: 932; Prenosov: 16
.pdf Celotno besedilo (354,73 KB)

86.
Classification of cubic vertex-transitive tricirculants
Primož Potočnik, Micael Toledo, 2020, izvirni znanstveni članek

Ključne besede: graph, cubic, semiregular automorphism, tricirculant, vertex-transitive
Objavljeno v RUP: 03.01.2022; Ogledov: 886; Prenosov: 40
.pdf Celotno besedilo (1,18 MB)

87.
88.
89.
Regular polygonal systems
Jurij Kovič, 2019, izvirni znanstveni članek

Ključne besede: regular polygonal system, boundary code, face vector, symmetry group, reconstructibility from the boundary
Objavljeno v RUP: 03.01.2022; Ogledov: 862; Prenosov: 17
.pdf Celotno besedilo (353,82 KB)

90.
Splittable and unsplittable graphs and configurations
Nino Bašić, Jan Grošelj, Branko Grünbaum, Tomaž Pisanski, 2019, izvirni znanstveni članek

Opis: We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic ▫$(n_3)$▫ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability. Finally, we show that all cyclic flag-transitive configurations with the exception of the Fano plane and the Möbius-Kantor configuration are splittable.
Ključne besede: configuration of points and lines, unsplittable configuration, unsplittable graph, independent set, Levi graph, Grünbaum graph, splitting type, cyclic Haar graph
Objavljeno v RUP: 03.01.2022; Ogledov: 945; Prenosov: 19
.pdf Celotno besedilo (355,79 KB)

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