CO Seminar – Dmitrii Panasenko

CO Seminar – Dmitrii Panasenko

Loading Events

« All Events

CO Seminar – Dmitrii Panasenko

December 13 @ 12:30 - 13:30

Location: MF 12, also online (you can email a.khramova[at]tue.nl for the teams link)

Speaker: Dmitrii Panasenko (Umeå University)

Title: Strictly Deza graphs and the vertex connectivity
Abstract:
A k-regular graph on v vertices is called a Deza graph with parameters (v, k, b, a), b ≥ a if the number of common neighbors of any two distinct vertices takes two values: a or b. A Deza graph is called a strictly Deza graph if it has diameter 2 and is not strongly regular.
In this talk we will discuss the enumeration of strictly Deza graphs and the enumeration of special subclass of strictly Deza graphs called divisible design graphs. We will also discuss the constructions of divisible design graphs found during the enumeration.
We will also discuss the vertex connectivity of strictly Deza graphs and divisible design graphs. We will talk about cases with vertex connectivity less than k, where k is the regularity of the graph. In particular, we will show that the vertex connectivity of strictly Deza graphs can be less than k by any amount.

Details

Date:
December 13
Time:
12:30 - 13:30
Event Category: