2013-04-08 10:00-11:00 FAMNIT-SEMIN doc. dr. Polona Oblak (Fakulteta za računalništvo in informatiko, Univerza v Ljubljani.) On commuting graphs The \emph{commuting graph} $\Gamma(S)$ of a semigroup (or a semiring) $S$ is the graph, whose vertex set is the set of all…
2013-03-25 9:00-10:00 FAMNIT-SEMIN Nina Chiarelli Linear separation of totoal dominating sets in graphs A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce…
2013-03-25 10:00-11:00 FAMNIT-SEMIN dr. Barbara Boldin An extension of the classification of evolutionarily singular strategies in Adaptive Dynamics The existing classification of evolutionarily singular strategies in Adaptive Dynamics assumes an invasion exponent that is differentiable twice as a function of…
2013-03-18 11:00-12:00 FAMNIT-SEMIN Prof. Alexander A. Ivanov (Imperial College London, UK) Method to construct groups using group amalgams It is our pleasure to inform you that there will be a minicourse “Method to construct groups using group amalgams” (5 lectures)…
2013-03-18 10:00-11:00 FAMNIT-SEMIN Karla Počkaj Construction of G^1 Hermite rational spline motion of degree six Geometric interpolation techniques have many advantages, such as automatically chosen parametrization, lower degree of interpolants and optimal approximation order. In this talk a geometric continuous…
2012-10-15 10:00-11:00 FAMNIT-SEMIN Dr. Pim van ‘t Hof (University of Bergen, Norway) Obtaining Planarity by Contracting Few Edges The contraction of an edge uv in a graph G is the operation that deletes u and v from G, and replaces…
2013-03-11 10:00-11:00 FAMNIT-SEMIN Marcin Anholcer On Some Surprising Application of Graphs in Decision Making: Pairwise Comparisons In many multiple criteria decision making problems (in particular in the case of group expert decisions) the Pairwise Comparison Matrices (PCM) are used. In…
2013-03-04 10:00-11:00 FAMNIT-SEMIN Ademir Hujdurović Pentavalent arc-transitive bicirculants A bicirculant is a graph admitting an automorphism with two cycles of equal length in its cycle decomposition. A graph is said to be arc-transitive if its automorphism group acts transitively on…
2013-02-25 10:00-11:00 FAMNIT-SEMIN Janoš Vidali (Univerza v Ljubljani, Fakulteta za računalništvo) Extremal codes in distance-regular graphs with diameter 3 We study $1$-codes in distance-regular graphs of diameter $3$ that achieve three different bounds. We show that the intersection array of…
2013-02-18 10:00-11:00 FAMNIT-SEMIN Matjaž Konvalinka (UL FMF, Ljubljana) Tutte polytope The Cayley polytope was defined recently as the convex hull of Cayley compositions, introduced by Cayley in 1857. In this talk, I will describe how we resolved Braun’s conjecture, which…