全部

Covers and Pseudocovers of Symmetric Graphs

  • 演讲者:朱砚舟(南科大)

  • 时间:2023-02-13 16:30-17:10

  • 地点:理学院大楼M616

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.