Maximal buttonings of non-tree graphs

• المؤلفون الرئيسيون: Wanchai Tapanyo, Pradthana Jaipong
• التنسيق: دورية
• منشور في: 2018
• الموضوعات: Agricultural and Biological Sciences; Arts and Humanities
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/46989

© 2017 by the Mathematical Association of Thailand. All rights reserved. Let G be a finite connected graph of n vertices v 1 , v 2 ,…, v n . A buttoning of G is a closed walk consisting of n shortest paths [v 1 , v 2 ], [v 2 , v 3 ],…, [v n−1 , v n ], [v n , v 1 ]. The buttoning is said to be maxima...