cc179d7b-7a7c-4046-bce3-94f0bea74e64 beie director@blueeyesintelligence.org 10.35940/ijitee.G9941.0611722 Arumugam S, Ramachandran S, Invitation to graph Theory, Scitech Pvt,2002.Cormen T.H., Leiserson C.E, Rivest R.L., Stein C., Introduction to Algorithms,PHI,2008.10.1145/76380.76381Denning P.J.et al, Computing as a decipline, Communications of ACM, January 1989 Vol 32,Number 1. [CrossRef]Deo N.,Graph Theory with applications to Engineering and Computer Science,PHI.,2006.10.1155/S016117128700019XFarrell E. J, Wahid S. A., On the Reconstruction of the matching Polynomial and the Reconstruction Conjecture, Int. J. Math & Math Sci., Vol.10,No.1,1987,pp.155-162. [CrossRef]Garey M. R. and Jhonson D.S, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Fracisco,1979.Knuth D.E.,The art of computer programming, Volume 4,Fascicle 0,2008.10.1109/TCT.1965.1082385Minty , G.J.,A simple algorithm for listing all the trees of a graph, IEEE Trans. Circuit Theory,12(1965),120. [CrossRef]Peikarski M., Listing of all possible trees of a Linear Graph,ibid.,CT-12, Corresn.,pp. 347-359,1961.Reingold E.M, Neivergelt J., Beo N. , Combinatorial Algorithms: Theory and Practice, PHI, 1977.Sarma Sen S., etal, All circuits of a symmetric Graph, Editor Report, IEEE,1981.10.1080/03772063.1981.11452333Sarma Sen S., et al, An efficient tree generation algorithm, Journal of Institution of Electronics and Telecommunications Engg.(IETE),Vol 27,No 3,pp 105-109,1981. [CrossRef]10.1109/2.294849Srinivas M., Patnaik L.M. Genetic Algorithms: A Survey.,IEEE,1994. [CrossRef]Tutte W.T., Graph Theory As I Have Known It, Oxford Science Publication,1998.