2012-05-28 11:00-12:00 dr. Fabio Vlacci (Università degli Studi di Firenze, Italy) Introduction to basic properties of a new class of regular functions of (hypercomplex) quaternionic variable The aim of this talk is to give a self-contained introduction to a new…
2012-05-28 10:00-11:00 dr. Wilfried Imrich (University of Leoben, Austria) The distinguishing and endomorphism distinguishing number of graphs and groups The distinguishing number of graphs was introduced by Albertson and Collins 1996, and has spawned a wealth of results on finite…
2012-05-24 13:00-13:45 Hiroki Koike The isomorphism problem for cyclic configurations Abstract: An incidence geometry consists on a set of points X of points and a set of blocks, or lines (subsets of X), such that two blocks intesect in at…
2012-05-24 13:45-14:30 Samed Bajrić The Representations of Vectorial Boolean Functions
2012-05-21 dr.Ilya Ponomarenko (V. A. Steklov Institute of Mathematics,Russia) Solvability of finite Schur groups Let G be a Schur group, i.e. each Schur ring over G arises from a suitable permutation group which contains a regular subgroup isomorphic to G.…
2012-05-17 Alexander Vasilyev Approach of lazy calculations in application to topological graph indices in Sage. Introduction to a new molecular class Abstract: Previously we introduced a molecular graph class based on standard Sage graph class. The classical approach of object-oriented model proved…
2012-05-17 Iva Antončič Half-arc-transitive graphs of particular orders Abstract: A graph is said to be half-arc-transitive if the automorphism group of the graph acts transitively on the vertex set and the edge set of the graph, but not on the…
2012-05-14 dr. Roman Nedela (Matej Bel University, Slovakia) 6-decompositions of snarks A snark is a cubic graph with no proper $3$-edge-colouring. In 1996, Nedela and \v Skoviera proved the following theorem: Let $G$ be a snark with an $k$-edge-cut, $k\geq…
10.05.2012 Lecturer: Nina Chiarelli Title: Split graphs and threshold graphs Abstract: The chromatic number of a graph is the minimum number of colors needed to color the vertices of the graph in such a way that no adjacent vertices have…
10.05.2012 Lecturer: Ademir Hujdurović Title: Half-arc-transitive graphs with small number of alternets Abstract: A graph is said to be half-arc-transitive if the automorphism group of the graph acts transitively on the vertex set and the edge set of the graph,…