2013-05-27 10:00-11:00 FAMNIT-SEMIN (Kettejeva 1, Koper) Boštjan Frelih On 2-distance-balanced graphs A graph $X$ is said to be distance-balanced if for any edge $uv$ of $X$, the number of vertices closer to $u$ than to $v$ is equal to the…
2013-05-20 10:00 – 11:00 FAMNIT-SEMIN (Kettejeva 1, Koper)) Samed Bajrić On Generalized Bent Functions With Dillon’s Exponents In this talk we investigate the possibility of constructing bent functions over fields with odd characteristic. We show that the necessary and sufficient…
2013-05-13 10:00-11:00 FAMNIT-SEMIN (Kettejeva 1, Koper) prof. Eugenio G. Omodeo (University of Trieste) Diophantine equations and (un)decidability Suppose a problem has been modeled as a Diophantine equation D(x_1,…,x_n)=0 in any number n of unknowns, to be solved over the integers: here…
2013-05-06 10:00-11:00 FAMNIT-SEMIN Sergio Hiroki Koike Quintanar Flag bicolorings and pseudo-orientations of maps. The idea of consistent colorings of the flags of a map with two colors has appeared previously in the literature in di ferent contexts. This talk present…
2013-04-29 10:00-11:00 FAMNIT-SEMIN Prof. György Kiss (Eötvös Loránd University, Hungary) On m-factorizations of complete multigraphs and designs The complete multigraph $\lambda K_{v}$ has $v$ vertices and $\lambda$ edgesjoining each pair of vertices. An $m$-factor of the complete multigraph$\lambda K_{v}$ is a…
2013-04-22 10:00-11:00 FAMNIT-SEMIN Dijana Ilišević (University of Zagreb, Croatia) Generalized Bicircular Projections A projection P on a complex Banach space X is called a generalized bicircular projection if the mappingP + a( I-P ) is an isometry for some modulus one complex number a. …
2013-04-15 10:00-11:00 FAMNIT-SEMIN Arjana Žitnik (FMF, Ljubljana) TheCover Each finite graph on n vertices determines a special (n-1)-fold covering graph that we call TheCover. Several equivalent definitions and basic properties about this remarkable construction are presented. In particular, we show…
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…