|
Fault Tolerant, Graphical Design and Extremel Problems
J. Opatrny, D. Sotteau, N. Srinivasan and K. Thulasiraman, “DCC Linear Congruential Graphs: A New Class of Interconnection Networks”, IEEE Trans. Computers, Vol. 45, Feb. 1996, pp. 156-164.
V. Krishnamoorthy, K. Thulasiraman and M. N. S. Swamy, “Minimum Order Graphs with Specified Diameter, Connectivity and Regularity”, Networks Journal, Vol. 19, 1989, pp. 24-46.
V. Krishnamoorthy, K. Thulasiraman and M. N. S.Swamy, “Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance”, IEEE Transactions on Computers, Vol.39, Feb. 1990, pp.230-237.
P. K. Rajan and K. Thulasiraman, “On an Extremal Problem in Graph Theory and Its Applications”, Proc. IEEE International Symposium on Circuits and Systems, Tokyo, July 1979, pp. 445-448
P. K. Rajan and K. Thulasiraman, “K-Sets of a Graph and Vulnerability of Communication Nets”, Matrix and Tensor Quarterly, 1974, pp.77-86.
P. K. Rajan and K.Thulasiraman, “ K-Sets of a Graph and Vulnerability of Communication Nets”, Matrix and Tensor Quarterly, 1974, pp.63-66.