講座主題：Edge-transitive bi-Cayley graphs
主講人： 周進(jìn)鑫
工作單位：北京交通大學(xué)
活動(dòng)時(shí)間：2020年11月21日 10:10—11:00
講座地點(diǎn)：騰訊會(huì)議會(huì)議ID：664 308 202
主辦單位：煙臺(tái)大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院
內(nèi)容摘要：
A graph admitting a group H of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a bi-Cayley graph over H. This generalisation of a Cayley graph gives a class of graphs that includes many important examples such as the Petersen graph, the Gray graph and the Hoffman-Singleton graph, and most of the known examples are actually edge-transitive. In this talk, I shall introduce some of our recent work regarding edge-transitive bi-Cayley graphs.
主講人介紹：
周進(jìn)鑫，北京交通大學(xué)教授、博士生導(dǎo)師。主要從事群與圖方面的研究，目前在Journal of Combinatorial Theory Series B(A)、Combinatorica、Journal of Graph Theory、European Journal of Combinatorics、Journal of Algebraic Combinatorics、IEEE Transactions on Computers等圖論、組合及計(jì)算機(jī)領(lǐng)域的一流期刊上發(fā)表論文70余篇。主持完成國(guó)家自然科學(xué)基金項(xiàng)目3項(xiàng)，在研1項(xiàng)。
