|
Counting and Enumeration
R. Jayakumar, K. Thulasiraman and M. N. S. Swamy, “MOD-CHAR: An Implementation of Char’s Spanning Tree Enumeration Algorithm and its Complexity Analysis”, IEEE Trans. on Circuits and Systems, Vol. CAS-36, Feb. 1989, pp. 219-228.
K. Thulasiraman, P. S. Reddy and M. G. G. Naidu, “Similarity of Graphs and Enumeration of Distinct nth Order Symmetric Sign Patterns”, Canadian Electrical Engineering Journal, Vol. 10, Jan. 1985, pp. 9-14. See also Proc. IEEE Intl. Symp. on Circuits and Systems, Rome, 1983.
R. Jayakumar, K. Thulasiraman and M. N. S. Swamy, “Complexity of Computation of a Spanning Tree Enumeration Algorithm”, IEEE Transactions on Circuits and Systems, Vol. CAS-31, October 1984,pp.853-860.Also see R. Jayakumar and K. Thulasiraman, “Analysis of a Spanning Tree Enumeration Algorithm”, Springer Verlag Lecture Notes on Mathematics, Vol. 882, 1982, pp. 281-290.
K. Thulasiraman, “A Combinatorial Problem in the Analysis of a Graph Algorithm and the Min-Tree Number of a Graph”, invited lecture at the South Asian Conference on Graph Theory, Singapore, May 1983.
K. Thulasiraman and M. N. S. Swamy, “A Theorem in the Theory of Determinants and the Number of Spanning Trees of a Graph”, Canadian Electrical Engg. Journal, Vol. 8, 1983, pp. 147-52.