E. Sampathkumar

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