R. Balakrishnan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
R. Balakrishnan has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- A. Anuradha
Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur 603203, Tamil Nadu, India
3 shared publications - A. Vijayakumar
Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India
1 shared publication - G. Indulal
St. Aloysius College
1 shared publication - Huishu Lian
College of Science China University of Mining and Technology 221116 Xuzhou P.R. China
1 shared publication - K. Viswanathan Iyer
Independent Researcher
1 shared publication - N. Sridharan
Departmentof Mathematics, Alagappa University, Karaikudi, TamilNadu, India
1 shared publication
Latest Publications
- 1 December 2014
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 45 (6) , 805-817
Some new families of integral graphs
- 1 December 2014
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 45 (6) , 805-817
Some new families of integral graphs
- Open Access
- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P18
Skew Spectra of Oriented Bipartite Graphs
A graph $G$ is said to have a parity-linked orientation $\phi$ if every even cycle $C_{2k}$ in $G^{\phi}$ is evenly (resp. oddly) oriented whenever $k$ is even (resp. odd). In this paper, this concept is used to provide an affirmative answer to the following conjecture of D. Cui and Y. Hou [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electronic J. Combin. 20(2):#P19, 2013]: Let $G=G(X,Y)$ be a bipartite graph. Call the $X\rightarrow Y$ orientation of $G,$ the canonical orientation. Let $\phi$ be any orientation of $G$ and let $Sp_S(G^{\phi})$ and $Sp(G)$ denote respectively the skew spectrum of $G^{\phi}$ and the spectrum of $G.$ Then $Sp_S(G^{\phi}) = {\bf{i}} Sp(G)$ if and only if $\phi$ is switching-equivalent to the canonical orientation of $G.$ Using this result, we determine the switch for a special family of oriented hypercubes $Q_d^{\phi},$ $d\geq 1.$ Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew spectrum of the resulting oriented product graph, which generalizes a result of Cui and Hou. Further this can be used to construct new families of oriented graphs with maximum skew energy.- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P18
Open AccessSkew Spectra of Oriented Bipartite Graphs
A graph $G$ is said to have a parity-linked orientation $\phi$ if every even cycle $C_{2k}$ in $G^{\phi}$ is evenly (resp. oddly) oriented whenever $k$ is even (resp. odd). In this paper, this concept is used to provide an affirmative answer to the following conjecture of D. Cui and Y. Hou [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electronic J. Combin. 20(2):#P19, 2013]: Let $G=G(X,Y)$ be a bipartite graph. Call the $X\rightarrow Y$ orientation of $G,$ the canonical orientation. Let $\phi$ be any orientation of $G$ and let $Sp_S(G^{\phi})$ and $Sp(G)$ denote respectively the skew spectrum of $G^{\phi}$ and the spectrum of $G.$ Then $Sp_S(G^{\phi}) = {\bf{i}} Sp(G)$ if and only if $\phi$ is switching-equivalent to the canonical orientation of $G.$ Using this result, we determine the switch for a special family of oriented hypercubes $Q_d^{\phi},$ $d\geq 1.$ Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew spectrum of the resulting oriented product graph, which generalizes a result of Cui and Hou. Further this can be used to construct new families of oriented graphs with maximum skew energy. - 28 April 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (8) , 949-950
Interpolation theorem for partial Grundy coloring
- 28 April 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (8) , 949-950
Interpolation theorem for partial Grundy coloring
- 1 January 2013
- Published by Springer Nature
- p. 1-12
Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
- 1 January 2013
- Published by Springer Nature
- p. 1-12
Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
- 2 February 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (9) , 1493
Preface
- Open Access
A sharp lower bound for the Wiener index of a graph
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound. We obtain a sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G.
Open AccessA sharp lower bound for the Wiener index of a graph
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound. We obtain a sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G.