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 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...
Saved in:
Main Authors: | Wanchai Tapanyo, Pradthana Jaipong |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/46989 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Maximal buttonings of non-tree graphs
by: Wanchai Tapanyo, et al.
Published: (2018) -
Chromatic Numbers of Suborbital Graphs for the Modular Group and the Extended Modular Group
by: Wanchai Tapanyo, et al.
Published: (2018) -
Generalized classes of suborbital graphs for the congruence subgroups of the modular group
by: Pradthana Jaipong, et al.
Published: (2019) -
Chromatic Numbers of Suborbital Graphs for the Modular Group and the Extended Modular Group
by: Wanchai Tapanyo, et al.
Published: (2018) -
Effect of paclobutrazol on growth of young potted flame tree (Delonix regia (Hook.) Raf.)
by: P. Srikoat, et al.
Published: (2021)