Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/57500| Title: | Maximal buttonings of non-tree graphs |
| Authors: | Wanchai Tapanyo Pradthana Jaipong |
| Authors: | Wanchai Tapanyo Pradthana Jaipong |
| Keywords: | Mathematics |
| Issue Date: | 1-Dec-2017 |
| Abstract: | © 2017 by the Mathematical Association of Thailand. All rights reserved. Let G be a finite connected graph of n vertices v1, v2,…, vn. A buttoning of G is a closed walk consisting of n shortest paths [v1, v2], [v2, v3],…, [vn−1, vn], [vn, v1]. The buttoning is said to be maximal if it has a maximum length when compared with all other buttonings of G. The goal of this work is to find a length of a maximal buttoning of non-tree graphs: complete multipartite graphs, grid graphs and rooted products of graphs. |
| URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57500 |
| 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.