Rangaswami Balakrishnan

According to our database, Rangaswami Balakrishnan authored at least 13 papers between 2008 and 2017.

Collaborative distances:

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

2017

b-coloring of Cartesian product of odd graphs.

Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar

Ars Comb., 2017

2016

Preface.

Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu

Electron. Notes Discret. Math., 2016

2015

Bounds for the b-chromatic number of the Mycielskian of some families of graphs.

Rangaswami Balakrishnan, S. Francis Raj

Ars Comb., 2015

2014

b-Chromatic Number of Cartesian Product of Some Families of Graphs.

Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar

Graphs Comb., 2014

2013

Interpolation theorem for partial Grundy coloring.

Rangaswami Balakrishnan, T. Kavaskar

Discret. Math., 2013

Bounds for the <i>b</i>-chromatic number of <i>G</i>-<i>v</i>.

Rangaswami Balakrishnan, S. Francis Raj

Discret. Appl. Math., 2013

2012

b-coloring of Kneser graphs.

Rangaswami Balakrishnan, T. Kavaskar

Discret. Appl. Math., 2012

2011

Color Chain of a Graph.

Rangaswami Balakrishnan, T. Kavaskar

Graphs Comb., 2011

2010

The Wiener number of powers of the Mycielskian.

Rangaswami Balakrishnan, S. Francis Raj

Discuss. Math. Graph Theory, 2010

Fall coloring of graphs I.

Rangaswami Balakrishnan, T. Kavaskar

Discuss. Math. Graph Theory, 2010

2009

Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs.

S. Francis Raj, Rangaswami Balakrishnan

Electron. Notes Discret. Math., 2009

2008

The Wiener number of Kneser graphs.

Rangaswami Balakrishnan, S. Francis Raj

Discuss. Math. Graph Theory, 2008

Connectivity of the Mycielskian of a graph.

Rangaswami Balakrishnan, S. Francis Raj

Discret. Math., 2008