R. Balakrishnan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2023

Resistance distance in connected balanced digraphsR. Balakrishnan, S. Krishnamoorthy, Wasin So. DAM, 337:46-53, October 2023. [doi]

2019

Some properties of the Knödel graph $W(k, 2^{k})$, $k\ge 4$R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay. ajc, 74:17-32, 2019. [doi]

2016

Distance spectrum of Indu-Bala product of graphsG. Indulal, R. Balakrishnan. akcej, 13(3):230-234, 2016. [doi]

2015

Range-Based ICA Using a Nonsmooth Quasi-Newton Optimizer for Electroencephalographic Source Localization in Focal EpilepsyS. Easter Selvan, S. Thomas George, R. Balakrishnan. neco, 27(3):628-671, 2015. [doi]

2013

Skew Spectra of Oriented Bipartite GraphsA. Anuradha, R. Balakrishnan, Xiaolin Chen, Xueliang Li, Huishu Lian, Wasin So. combinatorics, 20(4):18, 2013. [doi]

2012

The energy of the Mycielskian of a regular graphR. Balakrishnan, T. Kavaskar, Wasin So. ajc, 52:163-172, 2012. [doi]

PrefaceR. Balakrishnan, R. B. Bapat, Sandi Klavzar, A. Vijayakumar, Thomas Zaslavsky, Xuding Zhu. DM, 312(9):1493, 2012. [doi]

2009

Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphsS. Francis Raj, R. Balakrishnan. endm, 34:353-358, 2009. [doi]

2008

Wiener index of graphs with more than one cut-vertexR. Balakrishnan, N. Sridharan, K. Viswanathan Iyer. appml, 21(9):922-927, 2008. [doi]

Connectivity of the Mycielskian of a graphR. Balakrishnan, S. Francis Raj. DM, 308(12):2607-2610, 2008. [doi]

2007

A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environmentThanukrishnan Srinivasan, R. Balakrishnan, S. A. Gangadharan, V. Hayawardh. icpads 2007: 1-8 [doi]

2006

Lossless compression for large scale cluster logsR. Balakrishnan, Ramendra K. Sahoo. ipps 2006: [doi]

Supervised Grid-of-Tries: A Novel Framework for Classifier ManagementT. Srinivasan, R. Balakrishnan, S. A. Gangadharan, V. Hayawardh. icdcn 2006: 373-378 [doi]

2003

On Hamilton cycle decompositions of the tensor product of complete graphsR. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu. DM, 268(1-3):49-58, 2003. [doi]

2000

On the existence of graphs with prescribed coloring parametersV. Yegnanarayanan, R. Balakrishnan, R. Sampathkumar. DM, 216(1-3):293-297, 2000. [doi]

1999

A Greedy Router with Technology Targetable OutputR. Balakrishnan, Richard F. Hobson. glvlsi 1999: 252-255 [doi]

1998

Extremal graphs in some coloring problemsR. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan. DM, 186(1-3):15-24, 1998. [doi]

Hamilton cycles in tensor product of graphsR. Balakrishnan, P. Paulraja. DM, 186(1-3):1-13, 1998. [doi]

1996

Decompositions of regular graphs into K::n:::::c::: v 2K::2::R. Balakrishnan, R. Sampathkumar. DM, 156(1-3):19-28, 1996. [doi]

1994

Decompositions of complete graphs into isomorphic bipartite subgraphsR. Balakrishnan, R. Sampathkumar. gc, 10(1):19-25, 1994. [doi]

1984

k-partite digraphsR. Balakrishnan, P. Paulraja. jgt, 8(3):423-426, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL