Person: V, Sunitha
Loading...
Name
Sunitha V
Job Title
Faculty
Email Address
Telephone
079-68261563
Birth Date
Specialization
Theory, Algorithms (Parallel, Distributed, Dynamic), Applications of Graphs
Abstract
Biography
Dr. Sunitha has her research interest in graph theory, graph algorithms and their applications in Interconnection Networks of HPC, Computer and Communication Networks, Complex Networks
Research Projects
Organizational Units
Name
9 results
Search Results
Now showing 1 - 9 of 9
Publication Metadata only Implementation of quantum hitting times of cubelike graphs on IBM's Qiskit platform(World Scientific, 01-10-2022) Mulherkar, Jaideep; Rajdeepak, Rishikant; V, Sunitha; DA-IICT, Gandhinagar; Rajdeepak, Rishikant (201521006)In this paper, we give a procedure to construct quantum circuits for implementing discrete-time quantum walks on a family of Cayley graphs called cubelike graphs. We construct these circuits on IBM�s Qiskit platform and demonstrate an implementation of the quantum hitting times on cubelike graphs. Based on our numerical study, we conjecture that for all families of cubelike graphs there is a linear relationship between the degree of a cubelike graph and its hitting time which holds asymptotically. This conjecture, if proved, will generalize the result of hitting times of discrete-time quantum walks on hypercubes to general family of cubelike graphs.Publication Metadata only Capacity of a quantum memory channel correlated by matrix product states(Springer, 2018-04-01) Mulherkar, Jaideep; V, Sunitha; DA-IICT, GandhinagarWe study the capacity of a quantum channel where channel acts like controlled phase gate with the control being provided by a one-dimensional quantum spin chain environment. Due to the correlations in the spin chain, we get a quantum channel with memory. We derive formulas for the quantum capacity of this channel when the spin state is a matrix product state. Particularly, we derive exact formulas for the capacity of the quantum memory channel when the environment state is the ground state of the AKLT model and the Majumdar�Ghosh model. We find that the behavior of the capacity for the range of the parameters is analytic.Publication Metadata only Disjoint paths in hypercubes with prescribed origins and lengths(01-09-2009) Choudum, SA; Lavanya, S; V, Sunitha; DA-IICT, GandhinagarGiven (i) any k vertices u 1 ,u 2 ,?,u k (1?kPublication Metadata only Embedding double starlike trees into hypercubes(01-01-2011) Chouduma, S A; Lavanyaa, S; V, Sunitha; DA-IICT, GandhinagarA�double starlike tree�is a subdivision of a double star where the edge joining the central vertices is not subdivided. It was conjectured and subsequently proved by Kobeissi and Mollard [M. Kobeissi and M. Mollard,�Spanning graphs of hypercubes: Starlike and double starlike trees, Discrete Math. 244 (2002), pp. 231�239; M. Kobeissi and M. Mollard,�Disjoint cycles and spanning graphs of hypercubes, Discrete Math. 288 (2004), pp. 73�87]. that every equipartite double starlike tree on 2�n�vertices with maximum degree at most�n�spans the hypercube of dimension�n. In this note, we present an alternative and simple proof of this theorem using our results proved recently in Choudum�et al. [S.A. Choudum, S. Lavanya and V. Sunitha,�Disjoint paths in hypercubes with prescribed origins and lengths, Int. J. Comput. Math. 87 (2010), pp. 1692�1708].Publication Metadata only Influence of multiple spreaders through farthest first traversal(Springer) Ramrakhiyani, Madhvi; Tiwari, Mukesh; V, Sunitha; DA-IICT, Gandhinagar; Ramrakhiyani, MadhviIdentifying influential spreaders in complex networks is crucial for improving the efficiency of spreading processes. In this paper, we use a farthest first traversal to partition the network into communities and identify influential spreaders. The spreaders selected by this method satisfy the two criteria of being dispersed as well as influential in their neighborhood. Using an SIR-based epidemic spread on network datasets we examine the spreading ability of the influential spreaders. We compare the epidemic size when initial spreaders are selected from each community with ranked initial spreaders but no assurance of representation from each community. A larger epidemic size is observed when the initial influential spreaders are dispersed and selected from each community. In addition, the spread ability of influential spreaders selected by the proposed methods is similar to those obtained by creating non-overlapped communities using the Louvain algorithm, provided they are selected by using the same criteria.Publication Metadata only Automorphisms of augmented cubes(01-11-2008) A, Choudum S; V, Sunitha; DA-IICT, GandhinagarA variation of the hypercube, the augmented cube�AQ�n�of dimension�n�is defined as follows. It has 2�n�vertices, each labelled by an�n-bit binary string�a�1�a�2���a�n�. Define�AQ�1=K�2. For�n?2,�AQ�n�is obtained by taking two copies��and��of�AQ�n?1, with vertex sets�,�, and joining 0�a�2�a�3���a�n�with 1�b�2�b�3���b�n�iff either (i)�a�2�a�3���a�n�=b�2�b�3���b�n�, or (ii)�. In this paper, we observe that�AQ�n�is a Cayley graph and identify its automorphism group.Publication Metadata only Identification of critical regulatory genes in cancer signaling network using controllability analysis(Elsevier, 15-05-2017) Ravindran, Vandana; V, Sunitha; Bagler, Ganesh; DA-IICT, Gandhinagar; Ravindran, Vandana (201221013)Cancer is characterized by a complex web of regulatory mechanisms which makes it difficult to identify features that are central to its control. Molecular integrative models of cancer, generated with the help of data from experimental assays, facilitate use of control theory to probe for ways of controlling the state of such a complex dynamic network. We modeled the human cancer signaling network as a directed graph and analyzed it for its controllability, identification of driver nodes and their characterization. We identified the driver nodes using the maximum matching algorithm and classified them as backbone, peripheral and ordinary based on their role in regulatory interactions and control of the network. We found that the backbone driver nodes were key to driving the regulatory network into cancer phenotype (via mutations) as well as for steering into healthy phenotype (as drug targets). This implies that while backbone genes could lead to cancer by virtue of mutations, they are also therapeutic targets of cancer. Further, based on their impact on the size of the set of driver nodes, genes were characterized as indispensable, dispensable and neutral. Indispensable nodes within backbone of the network emerged as central to regulatory mechanisms of control of cancer. In addition to probing the cancer signaling network from the perspective of control, our findings suggest that indispensable backbone driver nodes could be potentially leveraged as therapeutic targets. This study also illustrates the application of structural controllability for studying the mechanisms underlying the regulation of complex diseases.Publication Metadata only Network controllability analysis of intracellular signalling reveals viruses are actively controlling molecular systems(Scientific Reports, 14-02-2019) Ravindran, Vandana; Nacher, Jose C; Akutsu, Tatsuya; Ishitsuka, Masayuki; Osadcenco, Adrian; V, Sunitha; Bagler, Ganesh; Schwartz, Jean-Marc; Robertson, David L; DA-IICT, Gandhinagar; Ravindran, Vandana (201221013)In recent years control theory has been applied to biological systems with the aim of identifying the minimum set of molecular interactions that can drive the network to a required state. However, in an intra-cellular network it is unclear how control can be achieved in practice. To address this limitation we use viral infection, specifically human immunodeficiency virus type 1 (HIV-1) and hepatitis C virus (HCV), as a paradigm to model control of an infected cell. Using a large human signalling network comprised of over 6000 human proteins and more than 34000 directed interactions, we compared two states: normal/uninfected and infected. Our network controllability analysis demonstrates how a virus efficiently brings the dynamically organised host system into its control by mostly targeting existing critical control nodes, requiring fewer nodes than in the uninfected network. The lower number of control nodes is presumably to optimise exploitation of specific sub-systems needed for virus replication and/or involved in the host response to infection. Viral infection of the human system also permits discrimination between available network-control models, which demonstrates that the minimum dominating set (MDS) method better accounts for how the biological information and signals are organised during infection by identifying most viral proteins as critical driver nodes compared to the maximum matching (MM) method. Furthermore, the host driver nodes identified by MDS are distributed throughout the pathways enabling effective control of the cell via the high 'control centrality' of the viral and targeted host nodes. Our results demonstrate that control theory gives a more complete and dynamic understanding of virus exploitation of the host system when compared with previous analyses limited to static single-state networks.Publication Metadata only Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness(Elsevier, 01-12-2017) Jadeja, Mahipal; Muthu, Rahul; V, Sunitha; DA-IICT, Gandhinagar; Jadeja, Mahipal (201221015)Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes these sets are finite, but in many well known examples like geometric graphs (including interval graphs) they are infinite. One can also study the reverse problem of expressing the vertices of a given graph as distinct sets in such a way that adjacency coincides with intersection of the corresponding sets. The sets are usually required to conform to some template, depending on the problem, to be either a finite set, or some geometric set like intervals, circles, discs, cubes etc. The problem of representing a graph as an intersection graph of sets was first introduced by Erdos [Alon, Noga, Covering graphs by the minimum number of equivalence relations, Combinatorica 6(1986), 201�206] and they looked at minimising the underlying universal set necessary to represent any given graph. In that paper it was shown that the problem is NP complete. In this paper we study a natural variant of this problem which is to consider graphs where vertices represent distinct sets and adjacency coincides with disjointness. Although this is nearly the same problem on the complement graph, for specific families of graphs this is a more natural way of viewing it. The parameter we take into account is the minimum universe size possible (disregarding individual label sizes).