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: | , |
---|---|
格式: | 雜誌 |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85041961413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/46989 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
成為第一個發表評論!