| E. Sampathkumar | |
| Born | 10 June 1936 (age 88) |
| Mallur | |
| Death | 11 August 2024 |
| Citizenship | Indian |
| Alma mater | Central College of Bangalore University, |
| Karnataka University | |
| Occupation | Professor of Mathematics |
| Scientific career | |
| Fields | Graph Theory |
| Institutions | Karnatak University, |
| University of Mysore | |
| Doctoral advisor | C. N. S. Iyengar |
Prof. 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.
He was chairman of the Department of Mathematics of the Karnataka university, Dharwad and the University of Mysore (1992–95). Born and raised in Mallur village, Channapatna Taluk, Ramanagara(District), outside of Bangalore, he earned a M.Sc. (1955) in mathematics from Central College of Bangalore University, and a Ph.D. (1965) in mathematics (Some studies in Boolean algebra) from the Karnataka University, Dharwad.
He was a lecturer at the Department of Mathematics Karnataka College, Dharwad (1960–65), and then professor at the Department of Mathematics, Karnataka University, Dharwad (1966–1988).
He was the first in India to introduce Graph Theory as a subject at the M.Sc. level in 1970. The study of the subject has grown manifold under his stewardship and guidance. For this, he is refereed to as the Father of Graph Theory in India. His birthday on 10-Jun is now celebrated as “Graph Theory Day”.
He is a founding member of Ramanujan Mathematical Society (1984) and Academy of Discrete Mathematics and Applications (2005).
After retiring in 1996 from Mysore University (1989–96), he has been working for the Department of Science and Technology (India) as a principal investigator on several projects in graph theory. He was head at Department of Science and Technology in Mathematics, University of Mysore (1992–1995).
Graph Theory Students:
• V.N. Bhave 1975 Karnataka
• S.B. Chikkodimath 1975 Karnataka
• Bhalachandra R. Gudagudi 1976 Karnataka
• K.H. Kulkarani 1976 Karnataka
• H.B. Walikar 1982 Karnataka
• Prabha S. Neeralagi 1984 Karnataka
• C.V. Venkatachalam 1986 Karnataka
• S.S. Kamath 1989 Karnataka
• S.R. Jayaram 1989 Karnataka
• G.D. Kamath 1990 Karnataka
• L. Pushpa Latha 1994 Mysore
Publications:
| 1 | Eulerian hypergraphs. (with Pushpalatha, L.) Adv. Stud. Contemp. Math. (Kyungshang) 8 (2004) 115-119 05C65 (05C45) |
| 2 | Complement of a graph: a generalization. (with Pushpalatha, L.) Graphs Combin. 14 (1998) 377-392 05C75 |
| 3 | Generalized complements of a graph. (with Pushpa Latha, L., Venkatachalam, C. V., Bhat, Pradeep) Indian J. Pure Appl. Math. 29 (1998) 625-639 05C75 |
| 4 | Strong weak domination and domination balance in a graph. (with L.Pushpa Latha) Discrete Math. 161 (1996) 235-242 05C35 |
| 5 | Reconstruction of a graph of order p from its (p-1)-complements. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 27 (1996) 435-441 05C60 |
| 6 | Independent, perfect and connected neighbourhood numbers of a graph. (with Neeralagi, Prabha S.) J. Combin. Inform. System Sci. 19 (1994) 139-145 05C35 (05C40) |
| 7 | Semi-strong chromatic number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 26 (1995) 35-40 05C15 |
| 8 | Bilinear and trilinear partitions of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 843-850 05C35 |
| 9 | The global set-domination number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 1053-1057 05 C35 |
| 10 | Set domination in graphs. (with Pushpa Latha, L.) J. Graph Theory 18 (1994) 489-495 05C70 |
| 11 | A generalization of chromatic index. (with Kamath, G. D.) Discrete Math. 124 (1994) 173-177 05C15 |
| 12 | Characterizations of a cycle. Math. Student 61 (1992) 238-240 05C38 |
| 13 | Point-set domination number of a graph. (with Latha, L. Pushpa) Indian J. Pure Appl. Math. 24 (1993) 225-229 05C35 |
| 14 | Domination and neighbourhood critical, fixed, free and totally free points. (with Neeralagi, Prabha S.) Sankhyã Ser. A 54 (1992) 403-407 05C35 |
| 15 | Mixed domination in graphs. (with Kamath, S. S.) Sankhyã Ser. A 54 (1992) 399- 402 05C35 |
| 16 | k-size chromatic number of a graph. (with Kamath, G. D.) Sankhyã Ser. A 54 (1992) 393-397 05C15 |
| 17 | Generalizations of independence and chromatic numbers of a graph. Discrete Math. 115 (1993) 245-251 05C15 (05C35) |
| 18 | Chromatically fixed, free and totally free points in a graph. J. Combin. Inform. System Sci. 17 (1992) 130-138 05C15 |
| 19 | A generalization of Menger's theorem for certain unicyclic graphs. Graphs Combin. 8 (1992) 377-380 05C40 |
| 20 | The least point covering and domination numbers of a graph. Discrete Math. 86 (1990) 137-142 05C35 (05C70) |
| 21 | A characterization of trees. J. Karnatak Univ. Sci. 32 (1987) 192-193 05C05 The global domination number of a graph. J. Math. Phys. Sci. 23 (1989) 377-385 05C35 (05C70) |
| 22 | Chromatic partitions of a graph. (with Venkatachalam, C. V.) Discrete Math. 74 (1989) 227-239 05C15 |
| 23 | Connectivity of a graph---a generalization. J. Combin. Inform. System Sci. 9 (1984) 71-78 05C40 |
| 24 | (1,k)-domination in a graph. J. Math. Phys. Sci. 22 (1988) 613-619 05C35 |
| 25 | Reconstruction of a disconnected graph from its elementary partition graphs. (with Bhave, V. N.) J. Combin. Inform. System Sci. 9 (1984) 242-246 05C60 |
| 26 | Graphoidal covers and graphoidal covering number of a graph. (with Acharya, B. Devadas) Indian J. Pure Appl. Math. 18 (1987) 882-890 05C38 (05C70) |
| 27 | The line neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 17 (1986) 142-149 05C99 |
| 28 | The neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 16 (1985) 126-132 05C35 |
| 29 | A generalization of Menger's theorem for trees. J. Combin. Inform. System Sci. 8 (1983) 79-80 05C05 (05C38) On a conjecture of Cockayne and Hedetniemi. (with Walikar, H. B.) J. Combin. Inform. System Sci. 7 (1982) 212-215 05C70 (05C40) |
| 30 | Reconstruction of a pair of graphs from their concatenations. (with Kundu, Sukhamay, Shearer, James, Sturtevant, Dean) SIAM J. Algebraic Discrete Methods 1 (1980) 228-231 05C60 |
| 31 | The connected domination number of a graph. (with Walikar, H. B.) J. Math. Phys. Sci. 13 (1979) 607-613 05C40 |
| 32 | 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 |
| 33 | Partition graphs and coloring numbers of a graph. (with Bhave, V. N.) Discrete Math. 16 (1976) 57-60 05C15 |
| 34 | L-graphical partitions of an even number. J. Karnatak Univ. Sci. 20 (1975) 266-269 05C99 |
| 35 | Partition graphs of a graph. (with Bhave, V. N.) Progr. Math. (Allahabad) 9 (1975) 33-42 05C99 |
| 36 | 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 |
| 37 | On tensor product graphs. J. Austral. Math. Soc. 20 (1975) 268-273 05C99 |
| 38 | On the interchange graph of a finite planar graph. (with Kulli, V. R.) J. Indian Math. Soc. (N.S.) 37 (1973) 339-341 05C10 |
| 39 | On duplicate graphs. J. Indian Math. Soc. (N.S.) 37 (1973) 285-293 05C99 |
| 40 | On the line graph of subdivision graph. J. Karnatak Univ. Sci. 17 (1972) 259-260 05C99 |
| 41 | On the minimum number of line-disjoint paths in a finite tree. (with Gudagudi, B. R.) J. Karnatak Univ. Sci. 17 (1972) 257-258 05C05 |
| 42 | Transitive digraphs and topologies on a set. (with Kulkarni, K. H.) J. Karnatak Univ. Sci. 18 (1973) 266-273 05C20 |
| 43 | Semi-total graphs of a graph. I, II, III. (with Chikkodimath, S. B.) J. Karnatak Univ. Sci. 18 (1973) 274-296 05C99 |
| 44 | Characterizations of connected graphs. J. Karnatak Univ. Sci. 18 (1973) 312-314 05C99 |
| 45 | Group valued graphs. (with Bhave, V. N.) J. Karnatak Univ. Sci. 18 (1973) 325-328 05C25 |
| 46 | Point signed and line signed graphs. Nat. Acad. Sci. Lett. 7 (1984) 91-93 05C75 |
| 47 | Arbitrarily traceable graphs. (with Bhave, V. N.) Math. Student 43 (1975) 428-430 05C75 |
| 48 | Recent developments in the theory of domination in graphs (1979) |
| 49 | On the splitting graph of a graph (1980) |
| 50 | The “neighbourhood number'n,(G) of G is the minimum cardinality of an n-set (1985) |
| 51 | Semitotal graphs of a graph-I, J (1973) |
| 52 | Semigraphs and their applications. (2000) Report on the DST Project |
| 53 | Connectivity of a graph-a generalization (1984) J. Comb. Inf. Syst. Sci 9 (2), 71-78 |
| 54 | Generalized graph structures. (2006) Bull. Kerala Math. Assoc 3 (2), 65-123 |
| 55 | Color energy of a graph. (2013) Proc. Jangjeon Math. Soc 16 (3), 335-351 |
| 56 | Convex sets in a graph. (1984) Indian J. pure appl. Math 15 (10), 1065-1071 |
| 57 | Graphoidal covers of a graph: a creative review. (1996) Proceedings of the National workshop on Graph Theory and its Applications, Manonmaniam Sundaranar University, Tirunelveli, Eds. S. Arumugam, BD Acharya and E. Sampathkumar, Tata McGraw Hill 1 (28) |
| 58 | The Line n-sigraph of a symmetric n-sigraph. (1975) Journal of the Australian Mathematical Society 20 (3), 268-273 |
