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...

Full description

Saved in:

Bibliographic Details
Main Authors:	Wanchai Tapanyo, Pradthana Jaipong
Format:	Journal
Published:	2018
Subjects:	Agricultural and Biological Sciences Arts and Humanities
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

id	th-cmuir.6653943832-46989
record_format	dspace
spelling	th-cmuir.6653943832-469892018-04-25T07:34:39Z Maximal buttonings of non-tree graphs Wanchai Tapanyo Pradthana Jaipong Agricultural and Biological Sciences Arts and Humanities © 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 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-04-25T07:08:13Z 2018-04-25T07:08:13Z 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/46989
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Agricultural and Biological Sciences Arts and Humanities
spellingShingle	Agricultural and Biological Sciences Arts and Humanities 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 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 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/46989
_version_	1681422977203175424

Maximal buttonings of non-tree graphs

Similar Items