Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941| Title: | Seat arrangement problems |
| Authors: | Vites Longani Hatairat Yingtaweesittikul |
| Authors: | Vites Longani Hatairat Yingtaweesittikul |
| Keywords: | Mathematics |
| Issue Date: | 1-Aug-2016 |
| Abstract: | © 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. |
| URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941 |
| ISSN: | 16860209 |
| Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.