E. Sampathkumar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
E. Sampathkumar has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Csilla Bujtás
University of Ljubljana, Faculty of Mathematics and Physics, Ljubljana, Slovenia
3 shared publications L. Pushpalatha
3 shared publicationsB.D. Acharya
2 shared publicationsC.V. Venkatachalam
Karnatak Univ., India
2 shared publications- Charles Dominic
Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India
2 shared publications - Zsolt Tuza
HUN‐REN Alfréd Rényi Institute of Mathematics Budapest Hungary
2 shared publications
Latest Publications
- Open Access
- 1 January 2014
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 34 (4) , 707
Color energy of a unitary Cayley graph
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph (Xn)c and some gcd-graphs
- 1 January 2014
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 34 (4) , 707
Open AccessColor energy of a unitary Cayley graph
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph (Xn)c and some gcd-graphs
- 1 July 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (14) , 2102-2108
Vertex coloring without large polychromatic stars
- 1 July 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (14) , 2102-2108
Vertex coloring without large polychromatic stars
- 6 February 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (3) , 561-573
3-consecutive edge coloring of a graph
- 6 February 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (3) , 561-573
3-consecutive edge coloring of a graph
- 1 February 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (4) , 174-186
Improper C-colorings of graphs
- 1 February 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (4) , 174-186
Improper C-colorings of graphs
- 1 January 2010
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 30 (3) , 393
3-consecutive C-colorings of graphs
Discussiones Mathematicae Graph Theory
- 1 January 2010
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 30 (3) , 393
3-consecutive C-colorings of graphs
Discussiones Mathematicae Graph Theory
- 31 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 168-174
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
- 31 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 168-174
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
- 1 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 164-167
Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers
- 1 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 164-167
Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers
- 1 December 1996
- Published by Elsevier in Discrete Mathematics
- Vol. 161 (1-3) , 235-242
Strong weak domination and domination balance in a graph
- 1 December 1996
- Published by Elsevier in Discrete Mathematics
- Vol. 161 (1-3) , 235-242
Strong weak domination and domination balance in a graph
- 1 August 1994
- Published by Wiley in Journal of Graph Theory
- Vol. 18 (5) , 489-495
Set domination in graphs
Let G = (V, E) be a connected graph. A set D ⊂ V is a set‐dominating set (sd‐set) if for every set T ⊂ V − D, there exists a nonempty set S ⊂ D such that the subgraph 〈S ∪ T〉 induced by S ∪ T is connected. The set‐domination number γs(G) of G is the minimum cardinality of a sd‐set. In this paper we develop properties of this new parameter and relate it to some other known domination parameters.
- 1 August 1994
- Published by Wiley in Journal of Graph Theory
- Vol. 18 (5) , 489-495
Set domination in graphs
Let G = (V, E) be a connected graph. A set D ⊂ V is a set‐dominating set (sd‐set) if for every set T ⊂ V − D, there exists a nonempty set S ⊂ D such that the subgraph 〈S ∪ T〉 induced by S ∪ T is connected. The set‐domination number γs(G) of G is the minimum cardinality of a sd‐set. In this paper we develop properties of this new parameter and relate it to some other known domination parameters.
- 1 January 1994
- Published by Elsevier in Discrete Mathematics
- Vol. 124 (1-3) , 173-177
A generalization of chromatic index
- 1 January 1994
- Published by Elsevier in Discrete Mathematics
- Vol. 124 (1-3) , 173-177
A generalization of chromatic index