Zobrazeno 1 - 10
of 1 960
pro vyhledávání: '"Balaji, R."'
Autor:
Ferenc, Will, Kastein, Hannah, Lieu, Lauren, Wilson, Ryan, Huang, Yuan Rick, Gilles, Jerome, Bertozzi, Andrea L., Sharma, Balaji R., HomChaudhuri, Baisravan, Ramakrishnan, Subramanian, Kumar, Manish
Publikováno v:
012 American Control Conference, Montreal, Canada, June 2012
This paper considers cooperative control of robots involving two different testbed systems in remote locations with communication on the internet. This provides us the capability to exchange robots status like positions, velocities and directions nee
Externí odkaz:
http://arxiv.org/abs/2411.03614
Autor:
Balaji, R., Gupta, Vinayak
We show that all off-diagonal entries in the Moore-Penrose inverse of the distance Laplacian matrix of a tree are non-positive.
Externí odkaz:
http://arxiv.org/abs/2207.12402
Autor:
Balaji, R., Gupta, Vinayak
Distance matrices of some star like graphs are investigated in \cite{JAK}. These graphs are trees which are stars, wheel graphs, helm graphs and gear graphs. Except for gear graphs in the above list of star like graphs, there are precise formulas ava
Externí odkaz:
http://arxiv.org/abs/2205.02133
Let $G$ be a connected graph with $V(G)=\{1,\dotsc,n\}$. Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij}:=l_{ii}^{\dag} + l_{jj}^{\dag}-2 l_{ij}^{\dag}$, where $l_{ij}^\dag$ is the $(i,j)^{\rm th}$ entry of the M
Externí odkaz:
http://arxiv.org/abs/2111.02051
Autor:
Ganesan, V.G., Naren Shankar, R., Satish Kumar, K., Kumar Gupta, Naveen, Balaji, R., Kumar, Rahul, Alam, Tabish, Dobrotă, Dan
Publikováno v:
In International Journal of Heat and Fluid Flow July 2024 107
Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each GDM is an
Externí odkaz:
http://arxiv.org/abs/2103.03603
Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\] Let $D$ be
Externí odkaz:
http://arxiv.org/abs/2006.03289
Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n \times n$ symm
Externí odkaz:
http://arxiv.org/abs/2006.02841
Autor:
Suchita S. Gadekar, Rajesh A. Joshi, Balaji R. Madje, Shrikrishna T. Salunke, Suryakant B. Sapkal
Publikováno v:
Results in Chemistry, Vol 6, Iss , Pp 101074- (2023)
Synthesis, characterization and catalytic application of Zinc Oxide nanoparticles (ZnO NPs) with 1,4-Piperazinediethanesulfonic acid (PIPES) have been explored as a coupled catalyst for the condensation reaction of Dimedone (1), Benzaldehyde and (2)
Externí odkaz:
https://doaj.org/article/11c8a1b150ea455b82cc530407e30a5c
Autor:
Gadekar, Suchita S., Joshi, Rajesh A., Madje, Balaji R., Salunke, Shrikrishna T., Sapkal, Suryakant B.
Publikováno v:
In Results in Chemistry December 2023 6