mario.krajoski

2018-12-03 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Tomaž Pisanski (University of Primorska) Regular nut graphs and the Fowler extension A nut graph is a singular graph of nullity one with a kernel eigenvector having no component equal to 0. We attack the…

2018-11-28 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Siamak Yassemi (University of Tehran and Institute for Research in Fundamental Sciences, Iran) Castelnuovo – Mumford regularity of edge ideal of graphs Let G be a graph with n vertices, S=mathbb{K}[x_1,dots,x_n] be the polynomial ring…

2018-11-19 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Ted Dobson (University of Primorska) On Automorphisms of Haar graphs of Abelian Groups Let G be a group and Ssubseteq G. A Haar graph of G with connection set S has vertex set Z_2times G…

2018-11-12 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Martin Raič (UL FMF and UP FAMNIT) Central limit theorem and the Slepian-Stein method Roughly speaking, the celebrated central limit theorem says that a sum of many small independent random variables with sufficiently nice distributions…

2018-11-05 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Tomaž Pisanski (University of Primorska) A new generalization of generalized Petersen graphs We discuss a new family of cubic graphs, which we call $SGP$-graphs, that bears a close resemblance to the family of generalized Petersen…

2018-10-29 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Nevena Pivač (UP IAM) On the End-Vertex Problem For a given graph search algorithm and a graph G, a vertex v is said to be an end-vertex if there exists a corresponding search ordering of…

2018-10-23 16:00–17:00 FAMNIT-MP1 Ulrich Pferschy (University of Graz, Austria) On a Stackelberg Knapsack Game We consider a bi-level knapsack problem, where two players, the leader and the follower, are each associated with a subset of the items. The leader may…