E. Sampathkumar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidenceCsilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha. arscom, 128:165-173, 2016.

2014

Color energy of a unitary Cayley graphChandrashekar Adiga, E. Sampathkumar, M. A. Sriraj. dmgt, 34(4):707-721, 2014. [doi]

2013

Coloring of signed graphsS. Pirzada, Muhammad Ali Khan, E. Sampathkumar. colognetwente 2013: 191-195

2012

Vertex coloring without large polychromatic starsCsilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Push Palatha. DM, 312(14):2102-2108, 2012. [doi]

3-consecutive edge coloring of a graphCsilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpa Latha. DM, 312(3):561-573, 2012. [doi]

2011

Improper C-colorings of graphsCsilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpa Latha, R. C. Vasundhara. DAM, 159(4):174-186, 2011. [doi]

2010

3-consecutive C-colorings of graphsCsilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza. dmgt, 30(3):393-405, 2010. [doi]

2003

Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and coveringE. Sampathkumar, B. Devadas Acharya, Purnima Gupta. endm, 15:168-174, 2003. [doi]

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbersE. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum. endm, 15:164-167, 2003. [doi]

1998

Complement of a Graph: A GeneralizationE. Sampathkumar, L. Pushpa Latha. gc, 14(4):377-392, 1998. [doi]

1996

Strong weak domination and domination balance in a graphE. Sampathkumar, L. Pushpa Latha. DM, 161(1-3):235-242, 1996. [doi]

1994

A generalization of chromatic indexE. Sampathkumar, G. D. Kamath. DM, 124(1-3):173-177, 1994. [doi]

Set domination in graphsE. Sampathkumar, L. Pushpa Latha. jgt, 18(5):489-495, 1994. [doi]

1993

Generalizations of independence and chromatic numbers of a graphE. Sampathkumar. DM, 115(1-3):245-251, 1993. [doi]

1992

A generalization of Menger's theorem for certain unicyclic graphsE. Sampathkumar. gc, 8(4):377-380, 1992. [doi]

1990

The least point covering and domination numbers of a graphE. Sampathkumar. DM, 86(1-3):137-142, 1990. [doi]

1989

Chromatic partitions of a graphE. Sampathkumar, C. V. Venkatachalam. DM, 74(1-2):227-239, 1989. [doi]

1980

Reconstruction of a Pair of Graphs from their ConcatenationsSukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant. siammax, 1(2):228-231, 1980. [doi]

1976

Partition graphs and coloring numbers of a graphE. Sampathkumar, V. N. Bhave. DM, 16(1):57-60, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL