>
Fa   |   Ar   |   En
   on a class of symplectic graphs and their automorphisms  
   
نویسنده ziaee meysam ,alimirzaei shirin
منبع كنفرانس نظريه گراف و تركيبيات جبري - 2020 - دوره : 11 - یازدهمین کنفرانس بین المللی نظریه گراف و ترکیبیات جبری ایران - کد همایش: 9919164009 - صفحه:144 -147
چکیده    It easy to see that each graph is a modification of a reduced graph γ of the same rank. it is proved thatfor every reduced graph with binary rank 2r, there is a unique maximal graph with binary rank 2r whichconatins γ as an induced subgraph. these maximal graphs are called symplectic graphs. in this paper,we study the symplectic graphs which are defined over a ring. we also find the automorphism group ofsymplectic graphs which are defined over zpn, where p is a prime number and n is positive integer.
کلیدواژه automorphism ,symplectic graph ,symplectic group ,generalized symplectic graph
آدرس institute of iranmehr, institute of iranmehr, faculty of science, iran, university college of omran and tosseeh, university college of omran and tosseeh, faculty of science, iran
پست الکترونیکی mirzaee.shirin@yahoo.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved