@article{(Open Science Index):https://publications.waset.org/pdf/9384,
	  title     = {Ranking and Unranking Algorithms for k-ary Trees in Gray Code Order},
	  author    = {Fateme Ashari-Ghomi and  Najme Khorasani and  Abbas Nowzari-Dalini},
	  country	= {},
	  institution	= {},
	  abstract     = {In this paper, we present two new ranking and unranking
algorithms for k-ary trees represented by x-sequences in Gray
code order. These algorithms are based on a gray code generation algorithm
developed by Ahrabian et al.. In mentioned paper, a recursive
backtracking generation algorithm for x-sequences corresponding to
k-ary trees in Gray code was presented. This generation algorithm
is based on Vajnovszki-s algorithm for generating binary trees in
Gray code ordering. Up to our knowledge no ranking and unranking
algorithms were given for x-sequences in this ordering. we present
ranking and unranking algorithms with O(kn2) time complexity for
x-sequences in this Gray code ordering},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {6},
	  number    = {8},
	  year      = {2012},
	  pages     = {1020 - 1025},
	  ee        = {https://publications.waset.org/pdf/9384},
	  url   	= {https://publications.waset.org/vol/68},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 68, 2012},
	}