R. Balakrishnan

19 papers B 1Misc 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Resistance distance in connected balanced digraphs.
Discret. Appl. Math.
R. Balakrishnan, S. Krishnamoorthy, Wasin So
2019 J jnl
Some properties of the Knödel graph W(k, 2
Australas. J Comb.
R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay
2016 J jnl
Distance spectrum of Indu-Bala product of graphs.
AKCE Int. J. Graphs Comb.
Gopalapillai Indulal, R. Balakrishnan
2015 J jnl
Range-Based ICA Using a Nonsmooth Quasi-Newton Optimizer for Electroencephalographic Source Localization in Focal Epilepsy.
Neural Comput.
S. Easter Selvan, S. Thomas George, R. Balakrishnan
2013 J jnl
Skew Spectra of Oriented Bipartite Graphs.
Electron. J. Comb.
A. Anuradha, R. Balakrishnan, Xiaolin Chen, Xueliang Li, Huishu Lian, Wasin So
2012 J jnl
Preface.
Discret. Math.
R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu
2012 J jnl
The energy of the Mycielskian of a regular graph.
Australas. J Comb.
R. Balakrishnan, T. Kavaskar, Wasin So
2010 J jnl
A sharp lower bound for the Wiener index of a graph
CoRR
R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer
2008 J jnl
Wiener index of graphs with more than one cut-vertex.
Appl. Math. Lett.
R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer
2007 B conf
A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment.
ICPADS
Thanukrishnan Srinivasan, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar
2006 Misc conf
Supervised Grid-of-Tries: A Novel Framework for Classifier Management.
ICDCN
T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar
2003 J jnl
On Hamilton cycle decompositions of the tensor product of complete graphs.
Discret. Math.
R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
2000 J jnl
On the existence of graphs with prescribed coloring parameters.
Discret. Math.
Venkataraman Yegnanarayanan, R. Balakrishnan, R. Sampathkumar
1999 — conf
A Greedy Router with Technology Targetable Output.
Great Lakes Symposium on VLSI
R. Balakrishnan, Richard F. Hobson
1998 J jnl
Extremal graphs in some coloring problems.
Discret. Math.
R. Balakrishnan, R. Sampathkumar, Venkataraman Yegnanarayanan
1998 J jnl
Hamilton cycles in tensor product of graphs.
Discret. Math.
R. Balakrishnan, P. Paulraja
1996 J jnl
Decompositions of regular graphs into K
Discret. Math.
R. Balakrishnan, R. Sampathkumar
1994 J jnl
Decompositions of complete graphs into isomorphic bipartite subgraphs.
Graphs Comb.
R. Balakrishnan, R. Sampathkumar
1984 J jnl
Note on the existence of directed (
J. Graph Theory
R. Balakrishnan, P. Paulraja