A graph is half-arc-transitive if its full automorphism group acts transitively on its vertex set and edge set, but not arc set. A graph is said to be a bi-Cayley graph over a group H if it admits H as a semiregular automorphism group with two vertex-orbits. In this talk, I will introduce some results about half-arc-transitive bi-Cayley graphs.

张咪咪，河北师范大学数学科学学院副教授，主要研究方向为代数图论与组合网络，发表论文十余篇，主持国家自然科学基金青年基金和河北省自然科学基金青年基金各一项。