About:
E. Sampathkumar (born June 10, 1936) is a professor emeritus^{ }of graph theory from University of Mysore. He has contributed to domination number, bipartite double cover, and reconstruction theory. [More...]
E. Sampathkumar (born June 10, 1936) is a professor emeritus^{ }of graph theory from University of Mysore. He has contributed to domination number, bipartite double cover, and reconstruction theory. [More...]
Students: Prof. E. Sampathkumar has guided the following students in the pursuit of their Ph.D. in Graph Theory.

Publications:
 Eulerian hypergraphs. (with Pushpalatha, L.) Adv. Stud. Contemp. Math. (Kyungshang) 8 (2004) 115119 05C65 (05C45)
 Complement of a graph: a generalization. (with Pushpalatha, L.) Graphs Combin. 14 (1998) 377392 05C75
 Generalized
complements of a graph. (with Pushpa Latha, L., Venkatachalam, C. V.,
Bhat, Pradeep) Indian J. Pure Appl. Math. 29 (1998) 625639 05C75
 Strong weak domination and domination balance in a graph. (with L.Pushpa Latha) Discrete Math. 161 (1996) 235242 05C35
 Reconstruction
of a graph of order p from its (p1)complements. (with Pushpa Latha,
L.) Indian J. Pure Appl. Math. 27 (1996) 435441 05C60
 Independent,
perfect and connected neighbourhood numbers of a graph. (with
Neeralagi, Prabha S.) J. Combin. Inform. System Sci. 19 (1994) 139145
05C35 (05C40)
 Semistrong chromatic number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 26 (1995) 3540 05C15
 Bilinear and trilinear partitions of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 843850 05C35
 The global setdomination number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 10531057 05 C35
 Set domination in graphs. (with Pushpa Latha, L.) J. Graph Theory 18 (1994) 489495 05C70
 A generalization of chromatic index. (with Kamath, G. D.) Discrete Math. 124 (1994) 173177 05C15
 Characterizations of a cycle. Math. Student 61 (1992) 238240 05C38
 Pointset domination number of a graph. (with Latha, L. Pushpa), Indian J. Pure Appl. Math. 24 (1993) 225229 05C35
 Domination
and neighbourhood critical, fixed, free and totally free points. (with
Neeralagi, Prabha S.) Sankhyã Ser. A 54 (1992) 403407 05C35
 Mixed domination in graphs. (with Kamath, S. S.) Sankhyã Ser. A 54 (1992) 399402 05C35
 ksize chromatic number of a graph. (with Kamath, G. D.) Sankhyã Ser. A 54 (1992) 393397 05C15
 Generalizations of independence and chromatic numbers of a graph. Discrete Math. 115 (1993) 245251 05C15 (05C35)
 Chromatically fixed, free and totally free points in a graph. J. Combin. Inform. System Sci. 17 (1992) 130138 05C15
 A generalization of Menger's theorem for certain unicyclic graphs. Graphs Combin. 8 (1992) 377380 05C40
 The least point covering and domination numbers of a graph. Discrete Math. 86 (1990) 137142 05C35 (05C70)
 A characterization of trees. J. Karnatak Univ. Sci. 32 (1987) 192193 05C05
 The global domination number of a graph. J. Math. Phys. Sci. 23 (1989) 377385 05C35 (05C70)
 Chromatic partitions of a graph. (with Venkatachalam, C. V.) Discrete Math. 74 (1989) 227239 05C15
 Connectivity of a grapha generalization. J. Combin. Inform. System Sci. 9 (1984) 7178 05C40
 (1,k)domination
in a graph. J. Math. Phys. Sci. 22 (1988) 613619 05C35 25.
Reconstruction of a disconnected graph from its elementary partition
graphs. (with Bhave, V. N.) J. Combin. Inform. System Sci. 9 (1984)
242246 05C60
 Graphoidal covers and graphoidal covering number of a graph. (with Acharya, B. Devadas) Indian J. Pure Appl. Math. 18 (1987) 882890 05C38 (05C70)
 The line neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 17 (1986) 142149 05C99
 The neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 16 (1985) 126132 05C35
 A generalization of Menger's theorem for trees. J. Combin. Inform. System Sci. 8 (1983) 7980 05C05 (05C38)
 On a conjecture of Cockayne and Hedetniemi. (with Walikar, H. B.) J. Combin. Inform. System Sci. 7 (1982) 212215 05C70 (05C40)
 Reconstruction of a pair of graphs from their concatenations. (with Kundu, Sukhamay, Shearer, James, Sturtevant, Dean) SIAM J. Algebraic Discrete Methods 1 (1980) 228231 05C60
 The connected domination number of a graph. (with Walikar, H. B.) J. Math. Phys. Sci. 13 (1979) 607613 05C40
 A generalization of the chromatic and line chromatic numbers of a graph. (with Neeralagi, Prabha S., Venkatachalam, C. V.) J. Karnatak Univ. Sci. 22 (1977) 44 49 05C15
 Partition graphs and coloring numbers of a graph. (with Bhave, V. N.) Discrete Math. 16 (1976) 5760 05C15
 Lgraphical partitions of an even number. J. Karnatak Univ. Sci. 20 (1975) 266269 05C99
 Partition graphs of a graph. (with Bhave, V. N.) Progr. Math. (Allahabad) 9 (1975) 3342 05C99
 Reconstruction of a tree from its homomorphic images and other related transforms. (with Kundu, Sukhamay, Bhave, V. N.) J. Combin. Theory Ser. B 20 (1976) 117 123 05C05
 On tensor product graphs. J. Austral. Math. Soc. 20 (1975) 268273 05C99
 On the interchange graph of a finite planar graph. (with Kulli, V. R.) J. Indian Math. Soc. (N.S.) 37 (1973) 339341 05C10
 On duplicate graphs. J. Indian Math. Soc. (N.S.) 37 (1973) 285293 05C99
 On the line graph of subdivision graph. J. Karnatak Univ. Sci. 17 (1972) 259260 05C99
 On the minimum number of linedisjoint paths in a finite tree. (with Gudagudi, B.R.) J. Karnatak Univ. Sci. 17 (1972) 257258 05C05
 Transitive digraphs and topologies on a set. (with Kulkarni, K. H.) J. Karnatak Univ. Sci. 18 (1973) 266273 05C20
 Semitotal graphs of a graph. I, II, III. (with Chikkodimath, S. B.) J. Karnatak Univ. Sci. 18 (1973) 274296 05C99
 Characterizations of connected graphs. J. Karnatak Univ. Sci. 18 (1973) 312314 05C99
 Group valued graphs. (with Bhave, V. N.) J. Karnatak Univ. Sci. 18 (1973) 325328 05C25
 Point signed and line signed graphs. Nat. Acad. Sci. Lett. 7 (1984) 9193 05C75
 Arbitrarily traceable graphs. (with Bhave, V. N.) Math. Student 43 (1975) 428430 05C75
Other contributions:
 Founder of the Ramanujan Mathematical Society (1986)
 Founder of the Indian Mathematical Consortium (2014)