Maximal Buttonings of Non-Tree Graphs

Wanchai Tapanyo, Pradthana Jaipong


Let $G$ be a finite connected graph of $n$ vertices $v_1, v_2,\ldots, v_n$. A \emph{buttoning} of $G$ is a closed walk consisting of $n$ shortest paths $$[v_1,v_2],[v_2,v_3],\ldots,[v_{n-1},v_n],[v_n,v_1].$$The buttoning is said to be \emph{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 curtain graphs, such as complete multipartite graphs, grid graphs and rooted product of graphs.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|