PhD Thesis Defense – Sergio Hiroki Koike Quintanar

Datum / Date: 27.2.15
Čas / Time: 18:00
Predavalnica / Location: FAMNIT-MP1
Predavatelj / Lecturer: Sergio Hiroki Koike Quintanar
Naslov / Title: On the isomorphism problem of bi-Cayley graphs (PhD Thesis Defense)
Povzetek / Abstract:

In this PhD thesis we study the isomorphism problem of bi-Cayley graphs and the related question of classifying finite BCI-groups. More precisely, the following questions/problems are considered:

(i) Find effective, sufficient and necessary conditions for the isomorphism of two cyclic bi-Cayley graphs.
(ii) Which groups are 3-BCI-groups?
(iii) Which cubic bi-Cayley graphs are BCI-graphs?
(iv) Which cyclic balanced configurations have the CI-property?
(v) Analytical enumeration of balanced cyclic configurations.

Problem (i) is solved for tetravalent graphs. Problem (ii) is solved for nilpotent groups. We contribute to Problem (iii) by proving that all connected cubic arc-transitive bi-Cayley graphs over abelian groups are BCI-graphs. Regarding Problem (iv), we prove that all cyclic balanced configurations have the CI-property for which the number of points is either a product of two distinct primes, or a prime power. Regarding Problem (v), we derive a close formula for the number of connected cyclic configurations of type (v_3).

Delite z drugimi

Orodna vrstica za dostopnost

Politika zasebnosti / Privacy Overview

Ta spletna stran uporablja piškotke, da vam lahko zagotovi najboljšo možno uporabniško izkušnjo. Informacije o piškotkih se shranjujejo v vašem brskalniku in omogočajo funkcije, kot je prepoznavanje ob vašem ponovnem obisku spletne strani, ter pomagajo naši ekipi razumeti, kateri deli spletne strani so za vas najbolj zanimivi in uporabni.


This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.