Arjana Žitnik: Classification of quartic bicirculant nut graphs

Datum objave: 17. 3. 2024
Seminar za diskretno matematiko
torek
19
marec
Ura:
10.15
Lokacija:
Plemljev seminar, Jadranska 19

Povzetek/Abstract: A graph is called a nut graph, if zero is its eigenvalue of multiplicity one, and its corresponding eigenvector has no zero entries. There are four types of quartic bicirculant graphs. We (almost) classify quartic bicirculant graphs that are nut graphs by investigating properties of each of the four types.

This is joint work with Tomaž Pisanski and Primož Potočnik.