·Ç°¢±´¶ûÓÐÏÞµ¥Ò»ÈºÉϵĹãÒå¿­Àûͼ

2024.08.13

Ͷ¸å£º¹¨»ÝÓ¢²¿ÃÅ£ºÀíѧԺä¯ÀÀ´ÎÊý£º

»î¶¯ÐÅÏ¢

»ã±¨±êÌâ (Title)£º·Ç°¢±´¶ûÓÐÏÞµ¥Ò»ÈºÉϵĹãÒå¿­Àûͼ£¨Generalized Cayley graphs on non-abelian finite simple groups£©

»ã±¨ÈË (Speaker)£ºÑîÐñ ¸±½ÌÊÚ£¨ÉϺ£Á¢ÐŹÜÕʽðÈÚѧԺ£©

»ã±¨¹¦·ò (Time)£º2024Äê8ÔÂ15ÈÕ (ÖÜËÄ) 14:00

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿ GJ403

Ô¼ÇëÈË(Inviter)£º¼ÍÀö½à

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºThe isomorphism problem is a fundamental problem for algebraic and combinatorial structures, particularly in relation to Cayley graphs. In this talk, we consider generalized Cayley graphs, proposed by Marusic et al. in 1992. As a result, we defined (strongly, restricted) m-GCI-groups. These definitions are similar to those of m-CI-groups for Cayley graphs. We give a complete classification of 2-GCI-groups and 3-GCI-groups with respect to non-abelian finite simple groups.

¡¾ÍøÕ¾µØÍ¼¡¿