We stand with Ukraine  

R. Balakrishnan

This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.

Bibliography

2023
Resistance distance in connected balanced digraphs.
[BibTeX]
[DOI]
R. Balakrishnan
,
S. Krishnamoorthy
,
Wasin So
Discret. Appl. Math., October, 2023

2019
Some properties of the Knödel graph W(k, 2<sup>k</sup>), k≥4.
[BibTeX]
[DOI]
R. Balakrishnan
,
P. Paulraja
,
Wasin So
,
M. Vinay
Australas. J Comb., 2019

2016
Distance spectrum of Indu-Bala product of graphs.
[BibTeX]
[DOI]
Gopalapillai Indulal
,
R. Balakrishnan
AKCE Int. J. Graphs Comb., 2016

2015
Range-Based ICA Using a Nonsmooth Quasi-Newton Optimizer for Electroencephalographic Source Localization in Focal Epilepsy.
[BibTeX]
[DOI]
S. Easter Selvan
,
S. Thomas George
,
R. Balakrishnan
Neural Comput., 2015

2013
Skew Spectra of Oriented Bipartite Graphs.
[BibTeX]
[DOI]
A. Anuradha
,
R. Balakrishnan
,
Xiaolin Chen
,
Xueliang Li
,
Huishu Lian
,
Wasin So
Electron. J. Comb., 2013

2012
Preface.
[BibTeX]
[DOI]
R. Balakrishnan
,
R. B. Bapat
,
Sandi Klavzar
,
Ambat Vijayakumar
,
Thomas Zaslavsky
,
Xuding Zhu
Discret. Math., 2012

The energy of the Mycielskian of a regular graph.
[BibTeX]
[DOI]
R. Balakrishnan
,
T. Kavaskar
,
Wasin So
Australas. J Comb., 2012

2010
A sharp lower bound for the Wiener index of a graph
[BibTeX]
[DOI]
R. Balakrishnan
,
N. Sridharan
,
K. Viswanathan Iyer
CoRR, 2010

2008
Wiener index of graphs with more than one cut-vertex.
[BibTeX]
[DOI]
R. Balakrishnan
,
N. Sridharan
,
K. Viswanathan Iyer
Appl. Math. Lett., 2008

2007
A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment.
[BibTeX]
[DOI]
Thanukrishnan Srinivasan
,
R. Balakrishnan
,
S. A. Gangadharan
,
Hayawardh Vijayakumar
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

2006
Supervised Grid-of-Tries: A Novel Framework for Classifier Management.
[BibTeX]
[DOI]
T. Srinivasan
,
R. Balakrishnan
,
S. A. Gangadharan
,
Hayawardh Vijayakumar
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2003
On Hamilton cycle decompositions of the tensor product of complete graphs.
[BibTeX]
[DOI]
R. Balakrishnan
,
Jean-Claude Bermond
,
P. Paulraja
,
Min-Li Yu
Discret. Math., 2003

2000
On the existence of graphs with prescribed coloring parameters.
[BibTeX]
[DOI]
V. Yegnanarayanan
,
R. Balakrishnan
,
R. Sampathkumar
Discret. Math., 2000

1999
A Greedy Router with Technology Targetable Output.
[BibTeX]
[DOI]
R. Balakrishnan
,
Richard F. Hobson
Proceedings of the 9th Great Lakes Symposium on VLSI (GLS-VLSI '99), 1999

1998
Extremal graphs in some coloring problems.
[BibTeX]
[DOI]
R. Balakrishnan
,
R. Sampathkumar
,
V. Yegnanarayanan
Discret. Math., 1998

Hamilton cycles in tensor product of graphs.
[BibTeX]
[DOI]
R. Balakrishnan
,
P. Paulraja
Discret. Math., 1998

1996
Decompositions of regular graphs into K<sub>n</sub><sup>c</sup> v 2K<sub>2</sub>.
[BibTeX]
[DOI]
R. Balakrishnan
,
R. Sampathkumar
Discret. Math., 1996

1994
Decompositions of complete graphs into isomorphic bipartite subgraphs.
[BibTeX]
[DOI]
R. Balakrishnan
,
R. Sampathkumar
Graphs Comb., 1994

1984
Note on the existence of directed (<i>k</i> + 1)-cycles in diconnected complete <i>k</i>-partite digraphs.
[BibTeX]
[DOI]
R. Balakrishnan
,
P. Paulraja
J. Graph Theory, 1984


  Loading...