On Some Graphs Associated with Permutations

Show simple item record

dc.contributor.author Ahmadi, Bahman
dc.date.accessioned 2011-04-18T19:58:28Z
dc.date.available 2011-04-18T19:58:28Z
dc.date.issued 2011-04-02
dc.identifier.uri http://hdl.handle.net/10294/3302
dc.description.abstract A permutation on the set X = {1, 2, ... , n} is a bijective function from X to itself. The set of all permutations on X is called the symmetric group and is denoted by Sym(n). An m-cyclic permutation is a permutation which moves m elements of X "cycle-wise" and does not move the other elements. For any 2<=m<=n define the graph "Gamma(n,m)" to be the graph whose vertices are all the elements of Sym(n) and two vertices are adjacent if one of them is equal to the composition of the other one with an m-cyclic permutation. In this talk we study the maximum independent sets of these graphs. en_US
dc.language.iso en en_US
dc.publisher University of Regina Graduate Students' Association en_US
dc.relation.ispartofseries Session 3.5 en_US
dc.subject Graph en_US
dc.subject Permutation en_US
dc.subject Independent set en_US
dc.title On Some Graphs Associated with Permutations en_US
dc.type Presentation en_US
dc.description.authorstatus Student en_US
dc.description.peerreview yes en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search oURspace


My Account