November 25, 2026
Europe/Bratislava timezone

BISCETs are some of the most symmetric graphs you have ever seen

Not scheduled
20m
Študenti Informatika Poster session + coffee: works of students of the faculty Informatics

Speaker

Pavol Kollar

Description

Graphs are a versatile and ubiquitous model for many different types of situations - from road and computer networks to modelling the neural synapses. Often, these graphs become enormous in their size and the mere act of storing and then reading or loading them becomes an obstacle. In this case, graphs which have many symmetries are helpful, because the symmetry allows us to reduce the amount of information we need to recreate the graph.

The work we present focuses on BISCET graphs, which are highly symmetric. BISCET itself is an acronym - BIpartite Self Complementary Edge Transitive. The "edge transitive" part is the one that dictates that these graphs must be highly symmetric.
We will show examples of small BISCET graphs as well as a method for enumerating them.

Pracovisko fakulty (katedra)/ Department of Faculty Katedra Aplikovanej Informatiky
Tlač postru/ Print poster Budem požadovať tlač /I hereby required to print the poster in faculty

Author

Presentation materials

There are no materials yet.