Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Survey on Plane 3-Tree with Nearest Neighbor Interchanges and Chordal Bipartite Graph

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Tamanna Afroze

Tamanna Afroze. Survey on Plane 3-Tree with Nearest Neighbor Interchanges and Chordal Bipartite Graph. International Journal of Computer Applications 162(3):1-9, March 2017. BibTeX

	author = {Tamanna Afroze},
	title = {Survey on Plane 3-Tree with Nearest Neighbor Interchanges and Chordal Bipartite Graph},
	journal = {International Journal of Computer Applications},
	issue_date = {March 2017},
	volume = {162},
	number = {3},
	month = {Mar},
	year = {2017},
	issn = {0975-8887},
	pages = {1-9},
	numpages = {9},
	url = {},
	doi = {10.5120/ijca2017913298},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Graph theory is an ancient branch of engineering. Many problems of real-world have been solved by graph theory’s principles. In this survey paper, I want to present the plane 3-tree’s concept with an interesting branch of another topic of graph theory, that is, chordal bipartite graph. Throughout the development of this survey paper, we will present definitions of chordal graph, bipartite graph, tree, plane 3-tree and different operations of tree architecture. Then I will show a new way to look at the tree architecture with nearest neighbor interchanges. Nearest Neighbor Interchanges is a mechanism that deals with the operation of relative nodes in a tree architecture. Relative nodes are those nodes which come in a same branch or in different branch of a tree which do not interrupt the way from leaf to root with other nodes in the same branch or in another branch are used in the nearest neighbor interchanges to interchange or exchange.We have many applications in which we can apply this nearest neighbor interchange mechanism. The main application is in DNA matching, DNA synthesizing and ribosome particles analysis. I will clearly describe these features in detail in the specified sections of this survey paper. Next I want to show that plane 3-tree has passed the planarity criteria, that is, plane 3-tree is a planar graph and it has straight-line drawing. So, we can construct a bipartite, chordal and chordal bipartite graph which is relevant with the given plane 3-tree. The novelty of this survey paper comprised of several definitions, graphical illustrations of different graph operations and chordal bipartite equivalent of a plane 3-tree.


  1. Sarah Mark, Jeanette C. McLeod and Mike Steel. A navigation system for tree space. Journal of Graph Algorithms and Applications (JGAA),vol.20, pp247-268,April 2016.
  2. Debajyoti Mondal Rahnuma Islam Nishat Md. Saidur Rahman Muhammad Jawaherul Alam. Minimum-Area Drawings of Plane 3-Trees Journal of Graph Algorithms and Applications (JGAA),2009.
  3. Md Saidur Rahman. Basic Graph Theory 2002.
  4. Md Saidur Rahman. Planar Graph Drawing 2004.
  5. J. P. Spinrad. Efficient Graph Representations, American Mathematical Society 2003.


Graph, Tree, Planarity, Nearest Neighbor Interchanges, Chordality, Bipartite graph, Plane 3-Tree