Spanning Trees of a Triangle Snake Graph by BFS and DFS Algorithms
Srinivasa G1, S.Sujitha2
1Dr. Srinivasa G, Professor, Department of Mathematics, New Horizon College of Engineering, Bengaluru, India.
2Dr. S.Sujitha, Professor, Department of EEE, New Horizon College of Engineering, Bengaluru, India.
Manuscript received on 02 June 2019 | Revised Manuscript received on 10 June 2019 | Manuscript published on 30 June 2019 | PP: 866-868 | Volume-8 Issue-8, June 2019 | Retrieval Number: G5353058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Possible spanning trees of a triangular snake graph are outlined and extracted the spanning trees of a triangular snake graph by applying the method of breadth-first search and depth-first search algorithms; shows arrived spanning trees are not identical.
Keyword: Graph; Triangular snake graph; Tree; Spanning tree; Complement; Algorithm; Breadth-first search; Depth-first search Subject classification codes: 05C05; 05C85
Scope of the Article: Graph Algorithms and Graph Drawing.