Niranjan Balachandran

activity

20062026

most citedA transform of complementary aspects with applications to entropic uncertainty relations

16 citations · 30 across the 22 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

math.OC2017★ 1 cited

Efficient constrained sensor placement for observability of linear systems

Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

This article studies two problems related to observability and efficient constrained sensor placement in linear time-invariant discrete-time systems with partial state observations…

math.CO2017

Vertex transitive graphs $G$ with $χ_{D} (G) > χ (G)$ and small automorphism group

Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga

For a graph $G$ and a positive integer $k$ , a vertex labelling $f : V (G) \to {1, 2 \dots, k}$ is said to be $k$ -distinguishing if no non-trivial automorphism of $G$ preserves the sets…

math.CO2017

System of unbiased representatives for a collection of bicolorings

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra +1

Let $B$ denote a set of bicolorings of $[n]$ , where each bicoloring is a mapping of the points in $[n]$ to ${- 1, + 1}$ . For each $B \in B$ , let $Y_B=(B(1),\ldot…

eess.SY2017

Resilience of Complex Networks

Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

This article determines and characterizes the minimal number of actuators needed to ensure structural controllability of a linear system under structural alterations that can sever…

Efficient constrained sensor placement for observability of linear systems

Vertex transitive graphs G with χD​(G)>χ(G) and small automorphism group

System of unbiased representatives for a collection of bicolorings

Resilience of Complex Networks

Vertex transitive graphs $G$ with $χ_{D} (G) > χ (G)$ and small automorphism group