Univerza na Primorskem Fakulteta za matematiko, naravoslovje in informacijske tehnologije
SI | EN

Raziskovalni matematični seminar - Arhiv

2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010
1 2 3 4 5 6 7 8 9 10 11 12
Datum in ura / Date and time: 29.10.12
(10:00)
Predavalnica / Location: Seminar room at Galeb (Kettejeva 1, Koper)
Predavatelj / Lecturer: dr. Gabriel Verret
Naslov / Title: Growth of automorphism groups in arc-transitive graphs
Vsebina / Abstract:

Let Γ be a connected G-arc-transitive graph, let uv be an arc of Γ and let L be the permutation group induced by the action of the vertex-stabiliser Gv on the neighbourhood Γ(v).

I will talk about the problem of bounding |Guv| in terms of L and the order of Γ.

All welcome!


On Monday, October 22, 2012, at the Faculty of Mathematics, Natural Sciences and Information Technologies in Koper, there will be a research mathematical seminar. Seminar starts at 10:00, and it will be organized in the "Seminar room" at Galeb (Kettejeva 1, Koper).

This Monday, we will have two lectures, both will last for approximately 25 minutes.

(10:00-10:25) Vesna Andova (Institute of Mathematics and Physics, Skopje, Macedonia)
Title: Diameter on  fullerene graphs
Abstract: Fullerene graphs are 3-connected planar cubic graphs with all
faces of size 5 or 6.
In the talk I will present a results regarding the diameter of
icosahedral fullerenes and  fullerene graphs in general.  

 

 

 
(10:30-10:55) Riste Škrekovski (FMF and IMFM, Ljubljana, Slovenia)
Title: Some results on network centralitiy indicies
Abstract: Centrality is used to quantify an intuitive feeling that in
most networks some vertices are more central than others.
In the talk we consider some graph theoretical results on closeness,
betweenness centrality, and  eccentricity.

All welcome!

 


Datum in ura / Date and time: 8.10.12
(10:00)
Predavalnica / Location: Seminar room at Galeb (Kettejeva 1, Koper)
Predavatelj / Lecturer: Martin Milanič
Naslov / Title: On graphs whose complement and square are isomorphic
Vsebina / Abstract:

We study square-complementary graphs, that is, graphs whose complement and square are isomorphic.

We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-complementary graphs, give a characterization of natural numbers n for which there exists a square-complementary graph of order n, and characterize square-complementary graphs within various graph classes. The bipartite case turns out to be of particular interest.

Joint work with Anders Sune Pedersen, Daniel Pellicer and Gabriel Verret.