Maximal buttonings of non-tree graphs
© 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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | دورية |
| منشور في: |
2018
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57500 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| id |
th-cmuir.6653943832-57500 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-575002018-09-05T03:44:05Z Maximal buttonings of non-tree graphs Wanchai Tapanyo Pradthana Jaipong Mathematics © 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. 2018-09-05T03:44:05Z 2018-09-05T03:44:05Z 2017-12-01 Journal 16860209 2-s2.0-85041961413 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57500 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Wanchai Tapanyo Pradthana Jaipong Maximal buttonings of non-tree graphs |
| description |
© 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. |
| format |
Journal |
| author |
Wanchai Tapanyo Pradthana Jaipong |
| author_facet |
Wanchai Tapanyo Pradthana Jaipong |
| author_sort |
Wanchai Tapanyo |
| title |
Maximal buttonings of non-tree graphs |
| title_short |
Maximal buttonings of non-tree graphs |
| title_full |
Maximal buttonings of non-tree graphs |
| title_fullStr |
Maximal buttonings of non-tree graphs |
| title_full_unstemmed |
Maximal buttonings of non-tree graphs |
| title_sort |
maximal buttonings of non-tree graphs |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57500 |
| _version_ |
1681424890459062272 |