Research

All

Covers and Pseudocovers of Symmetric Graphs

  • Speaker: Yanzhou Zhu (SUSTech)

  • Time: Feb 13, 2023, 16:30-17:10

  • Location: M616, College of Science Bldg.

Abstract:
A symmetric graph  is said to be a pseudocover of its imprimitive quotient  if they have the same valency and the original graph is not a cover of its quotient We provide a criterion for a symmetric graph being a pseudocover of its quotient. 
Some related results for pseudocovers of complete graphs and tetravalent graphs will be given.

南方科技大学数学系微信公众号

© 2015 All Rights Reserved. 粤ICP备14051456号

Address: No 1088,xueyuan Rd., Xili, Nanshan District,Shenzhen,Guangdong,China 518055 Tel: +86-755-8801 0000