E. Sampathkumar

Publication Activity (10 Years)

Years Active: 1976-2016
Publications (10 Years): 1

Top Topics

Connected Components

Top Venues

Discuss. Math. Graph Theory

Publications

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128 (2016)
Chandrashekar Adiga, E. Sampathkumar, M. A. Sriraj
Color energy of a unitary Cayley graph. Discuss. Math. Graph Theory 34 (4) (2014)
Shariefuddin Pirzada, Muhammad Ali Khan, E. Sampathkumar
Coloring of signed graphs. CTW (2013)
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
Vertex coloring without large polychromatic stars. Discret. Math. 312 (14) (2012)
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha
3-consecutive edge coloring of a graph. Discret. Math. 312 (3) (2012)
Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara
Improper C-colorings of graphs. Discret. Appl. Math. 159 (4) (2011)
Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza
3-consecutive C-colorings of graphs. Discuss. Math. Graph Theory 30 (3) (2010)
E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers. Electron. Notes Discret. Math. 15 (2003)
E. Sampathkumar, B. Devadas Acharya, Purnima Gupta
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering. Electron. Notes Discret. Math. 15 (2003)
E. Sampathkumar, L. Pushpalatha
Complement of a Graph: A Generalization. Graphs Comb. 14 (4) (1998)
E. Sampathkumar, L. Pushpalatha
Strong weak domination and domination balance in a graph. Discret. Math. 161 (1-3) (1996)
E. Sampathkumar, L. Pushpalatha
Set domination in graphs. J. Graph Theory 18 (5) (1994)
E. Sampathkumar, G. D. Kamath
A generalization of chromatic index. Discret. Math. 124 (1-3) (1994)
E. Sampathkumar
Generalizations of independence and chromatic numbers of a graph. Discret. Math. 115 (1-3) (1993)
E. Sampathkumar
A generalization of Menger's theorem for certain unicyclic graphs. Graphs Comb. 8 (4) (1992)
E. Sampathkumar
The least point covering and domination numbers of a graph. Discret. Math. 86 (1-3) (1990)
E. Sampathkumar, C. V. Venkatachalam
Chromatic partitions of a graph. Discret. Math. 74 (1-2) (1989)
Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant
Reconstruction of a Pair of Graphs from their Concatenations. SIAM J. Algebraic Discret. Methods 1 (2) (1980)
E. Sampathkumar, V. N. Bhave
Partition graphs and coloring numbers of a graph. Discret. Math. 16 (1) (1976)