@article{(Open Science Index):https://publications.waset.org/pdf/4353, title = {Spanning Tree Transformation of Connected Graphs into Single-Row Networks}, author = {S.L. Loh and S. Salleh and N.H. Sarmin}, country = {}, institution = {}, abstract = {A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR).}, journal = {International Journal of Mathematical and Computational Sciences}, volume = {4}, number = {2}, year = {2010}, pages = {271 - 275}, ee = {https://publications.waset.org/pdf/4353}, url = {https://publications.waset.org/vol/38}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 38, 2010}, }