E. Sampathkumar

According to our database, E. Sampathkumar authored at least 19 papers between 1976 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Ars Comb., 2016

2014

Color energy of a unitary Cayley graph.

Chandrashekar Adiga, E. Sampathkumar, M. A. Sriraj

Discuss. Math. Graph Theory, 2014

2013

Coloring of signed graphs.

Shariefuddin Pirzada, Muhammad Ali Khan, E. Sampathkumar

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Vertex coloring without large polychromatic stars.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Discret. Math., 2012

3-consecutive edge coloring of a graph.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Discret. Math., 2012

2011

Improper C-colorings of graphs.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara

Discret. Appl. Math., 2011

2010

3-consecutive C-colorings of graphs.

Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza

Discuss. Math. Graph Theory, 2010

2003

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.

E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum

Electron. Notes Discret. Math., 2003

Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering.

E. Sampathkumar, B. Devadas Acharya, Purnima Gupta

Electron. Notes Discret. Math., 2003

1998

Complement of a Graph: A Generalization.

E. Sampathkumar, L. Pushpalatha

Graphs Comb., 1998

1996

Strong weak domination and domination balance in a graph.

E. Sampathkumar, L. Pushpalatha

Discret. Math., 1996

1994

Set domination in graphs.

E. Sampathkumar, L. Pushpalatha

J. Graph Theory, 1994

A generalization of chromatic index.

E. Sampathkumar, G. D. Kamath

Discret. Math., 1994

1993

Generalizations of independence and chromatic numbers of a graph.

E. Sampathkumar

Discret. Math., 1993

1992

A generalization of Menger's theorem for certain unicyclic graphs.

E. Sampathkumar

Graphs Comb., 1992

1990

The least point covering and domination numbers of a graph.

E. Sampathkumar

Discret. Math., 1990

1989

Chromatic partitions of a graph.

E. Sampathkumar, C. V. Venkatachalam

Discret. Math., 1989

1980

Reconstruction of a Pair of Graphs from their Concatenations.

Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant

SIAM J. Algebraic Discret. Methods, 1980

1976

Partition graphs and coloring numbers of a graph.

E. Sampathkumar, V. N. Bhave

Discret. Math., 1976