2015-01-05 10:00-11:00 FAMNIT-SEMIN Tatiana Hartinger Romina (UP IAM) On the structure of 1-perfectly orientable graphs Following the terminology of Kammer and Tholey, we say that an orientation of a graph is 1-perfect if the out-neighborhood of every vertex induces a…
2014-12-29 10:00-11:00 FAMNIT-SEMIN prof. dr. Vladimir Gurvich (Rutgers University, USA) On Nash-solvability of chess-like games In 2003, Boros and Gurvich proved that a chess-likes game has a Nash equilibrium (NE) in pure stationary strategies if (A) the number n of…
2014-12-22 10:00-11:00 FAMNIT-SEMIN dr. Martin Milanič (UP FAMNIT) Vector connectivity in graphs Motivated by challenges related to domination, connectivity, and information propagation in social and other networks, we study the Vector Connectivity problem. This problem takes as input a graph…
2014-12-15 10:00-12:00 FAMNIT-MP1 Alexander Vasilyev On Adriatic Indices, Spectral Properties of Adriatic Matrices and Software for Topological Descriptors
2014-12-08 11:15-12:15 FAMNIT-SEMIN Emil Žagar Geometric interpolation by parametric polynomial curves Interpolation of curves and surfaces is a fundamental problem in computer aidedgeometric design (CAGD) and related fields of research. In this talk we shallfocus on interpolation of parametric curves…
2014-12-01 10:00-10:45 FAMNIT-SEMIN dr. Francesco Belardo (UP FAMNIT) Spectral determination of signed graphs A signed graph is pair (G,s) where G is a graph and s, the signature, is a function on the edges of G assigning values in {1,-1}.…
2014-11-24 10:00-10:45 FAMNIT-SEMIN Dr. Jurij Kovič Japonska tempeljska geometrija
2014-11-17 10:00-10:45 FAMNIT-SEMIN Nina Chiarelli Equistarable bipartite graphs Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive vertex weights on the edges such that a subset of edges is of total weight 1 if…
2014-11-10 10:00-10:45 FAMNIT-SEMIN prof. dr. Tomaž Pisanski General Haar graphs in sage We implemented several programs that may deal with general Haar graphs. The programs are written in Python but embedded in the system sage. A Haar graph is a…
2014-11-03 10:00-10:45 FAMNIT-SEMIN dr. Rok Požar Solvable regular covering projections of graphs We present basic properties of universal covering projections and exploit them in order to develop an algorithm for computing all solvable regular covering projections of a given graph admitting a lift of…