Journal Papers
  1. Flow graph determinants, Electronic Letters, vol. 7, No. 26, December 1971.
  2. Evaluation of the determinants of cascade-connected Coates and Mason graphs, Electronics Letters, vol. 8, No. 16, August 1972, (with R. Cahit).
  3. Construction of the fundemental circuit matrix from a given tree set, Electronics Letters, vol. 8, No. 26, November 1972 (MR50#12816), (with R. Cahit).
  4. Generation of trees, cotrees and 2-trees of a linear graph, Proc IEE (London), vol.119, No. 9, September 1972, (with R. Cahit)
  5. Generation of simple paths of a graph by decomposition, Electronics Letters, vol. 10, No.2, January 1974 (MR56#15170).
  6. Synthesis of RC networks containing operational amplifiers using flow graph techniques, Electronic Letters, vol. 7, No. 15, July 1971, (with R. Cahit).
  7. Flexible active filter design using three operational amplifiers, Proc. IEEE, Vol. 62, No.16, June 1974, (with R. Cahit).
  8. Structural reliability of centralised tree networks, Electronics Letters, vol. 9, No. 26, December 1973, (with R. Cahit).
  9. Topological considerations in the design of optimum teleprocessing tree networks, Proc. IEE (London), vol.120, No.12, December 1973, (with R. Cahit).
  10. Structural reliability of centralized communication networks, IEEE Trans. Communications, vol.COM-22, No.10, October 1974, (with R. Cahit).
  11. Transformations on spanning trees, Journal of the Institute of Mathematics and its Applications, 258, 1978 (MR80a:68028), (with R. Cahit).
  12. Are all complete binary trees graceful?, American Mathematical Monthly, vol.83, No.1, January 1976.
  13. On graceful numbering of spanning trees, Information Processing Lett., vol.3, 1974/1975, (MR52#5455), (with R. Cahit).
  14. Realization of graceful permutation by a shuffle-exchange network, Information Processing Lett., vol.6, no.5, 1977, (MR56#10120).
  15. Elegant valuation of the paths, Ars Combinatoria, 16, 1983, (MR85g:05127).
  16. Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combinatoria, 23, 1978, (MR88f:05127).
  17. On cordial and 3-equitable graphs, Utilitas Mathematica, 37, 1990, (MR91I:05103).
  18. A problem in connection with equi-areal planar graphs, Bull. Inst. of Combinatorics and its Applic., 7, 1993, (MR1 206 766).
  19. On graceful trees, Bull. Inst. of Combinatorics and its Applic., 12, 1994, (MR96b:05147).
  20. Drawing the complete graph in 3D with straight lines and without crossing, Bull. Inst. of Combinatorics and its Applic., 12, 1994, (MR95k:05054).
  21. On harmonious trees labelings, Ars Combinatorics, 41, 1995, (MR96g:05121).
  22. Equitable tree labelings, Ars Combinatoria, 40, 1995, (MR96I:05148).
  23. H-cordial graphs, Bull. Inst. of the Combinatorics and its Applic., 18, 1996, (MR97g:05144).
  24. E-cordial graphs, (with R. Yilmaz), Ars Combinatoria, vol. 47, August 1997.
  25. On 2-visibility drawings of non-planar graphs, Bull. Inst. of Combinatorics and its Applic., 24, September 1998.
  26. Deadlock detection using (0,1)-labelling of resource allocation graphs, IEE Proc.-Comput. Digit. Tech., 145(1), January 1998.

    27.  

     
     
     

    Survey Papers


     
  27. Status of graceful tree conjecture in 1989, in Topics in Combinatorics and Graph Theory, (Oberwolfach, 1990), 175-184, Physica, Heidelberg, 1990, (MR92a:05113).
  28. Recent results and open problems on cordial graphs, in Contemporary Methods in Graph Theory, 209-230, Bibligraphisches Inst., Mannhiem, 1990, (MR92h:05118).

 

    Conference Papers


     
  1. Generation of trees, cotrees and 2-trees of a linear graph, Conference on Information and System Sciences, Honolulu, Hawaii, 1972, (with R. Cahit).
  2. Topological considerations in the design of optimum teleprocessing tree networks, 1973 National Telecommunication Conference, Atlanta, U.S.A., (with R. Cahit).
  3. Telephone numbering system in North Cyprus, 3rd National Electrical and Electronic Engineering Congress, Technical University of Istanbul, Istanbul, Turkey, September 1989 (in Turkish).
  4. Routings in log-N interconnection networks, 5th National Electrical and Electronic Engineering Congress, Izmir, Turkey, September 1992 (in Turkish).
  5. Application of Blazenet routing in interconnection networks, 5th National Electrical and Electronic Engineering Congrees, 9 Eylul University, Izmir, Turkey, September 1992 (in Turkish).
  6. Cycle routing in photonic interconnection networks, 7th National Electrical, Electronic and Computer Engineering Congress, Middle East Technical University, Ankara, Turkey, September 1997 (in Turkish).
  7. Routing in photonic Torus interconnection networks, (with A. Adalier), 7th National Electrical, Electronic and Computer Engineering Congrees, Middle East Technical University, Ankara, Turkey, September 1997 (in Turkish).
  8. Tree labelling problems: A survey, Turkish Mathematics Society, 5th National Mathematics Symposium, Eastern Mediterranean University, G. Magosa, September 1993.
  9. Edge-cordial graphs, (with R. Yilmaz), Turkish Mathematics Society, 7th National Mathematics Symposium, Bilkent University, Ankara, September 1994.
  10. M-cordial graphs, ( with A. Unveren), Turkish Mathematics Society, 7th National Mathematics Symposium, Bilkent University, Ankara, September 1994.
  11. S-cordial graphs, Turkish Mathematics Society, 7th National Mathematics Symposium, Bilkent University, Ankara, September 1994.
  12. Irregular assignment of the wheels and cubic graphs, (with M. Tezer), Turkish Mathematics Society, 6th National Mathematics Symposium, Cukurova University, September 1995.
  13. Regularable graphs, (with A. Unveren), Turkish Mathematics Society, 8th Turkish Mathematics Symposium, Technical University of Istanbul, September 1996.
  14. Recirculating interconnection networks: Directed graph representations, routing and crossover minimization, (with J. Giglmayr), 1996 Internat. Topical Meeting on Photonic in Switching, Sendai, Japan, April 1996, PWC8.
  15. On strong magic trees, 16th British Combinatorial Conference, Queen Mary and Westfield College, London University, July 1997.