Sunitha VadivelMurugan

Sunitha VadivelMurugan

Auto-generated profile, based on publicly available information

Sunitha VadivelMurugan

Dhirubhai Ambani Institute of Information and Communication Technology

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 July 2002 in Networks
Verified
Journal Article
Closed access
PDF file
SCS. A. Choudum
S. A. Choudum
VSV. Sunitha
V. Sunitha

1 May 2017 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
VRVandana Ravindran
Vandana Ravindran
SVSunitha V.
Sunitha V.
GBGanesh Bagler
Ganesh Bagler

9 October 2008 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
SCS. A. Choudum
S. A. Choudum
VSV. Sunitha
V. Sunitha
A 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.

1 July 2010 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
SCS. A. Choudum
S. A. Choudum
SLS. Lavanya
S. Lavanya
VSV. Sunitha
V. Sunitha
Given (i) any k vertices u 1, u 2, …, u k (1≤k<n) in the n-cube Q n , where (u 1, u 2), (u 3, u 4), …, (u 2m−1, u 2m ) (m≤⌊ k\2 ⌋) are edges of the same dimension, (ii) any k positive integers a 1, a 2, …, a k such that a 1, a 2, …, a 2m are odd and a 2m+1, …, a k are even, with a 1+a 2+···+a k =2 n , and (iii) k subsets W 1, W 2, …, W k of V(Q n ) with |W i |≤n−k and if a i =1, then u i ¬∈W i , for 1≤i≤k, we show that there exist k vertex-disjoint paths P (1), P (2), …, P (k) in Q n where P (i) contains a i vertices, its origin is u i , and its terminus is in V(Q n )/ W i , for 1≤i≤k. We also prove a similar result which extends two well-known results of Havel, [I. Havel On hamilton circuits and spanning trees of hypercubes, Časopis pro Pĕstování Matematiky, 109 (1984), pp. 135–152.] and Nebeský, [L. Nebeský Embedding m-quasistars into n-cubes, Czech. Math. J. 38 (1988), pp. 705–712].

1 December 2017 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
MJMahipal Jadeja
Mahipal Jadeja
RMRahul Muthu
Rahul Muthu
VSV. Sunitha
V. Sunitha

1 January 2008
Verified
Conference Paper
Closed access
KYKishore Yalamanchili
Kishore Yalamanchili
APAditya Pasalapudi
Aditya Pasalapudi
DMDeepak Majeti
Deepak Majeti
SVSunitha V
Sunitha V
Network on chip (NoC) is evolving as a promising paradigm for high density SoC (System on Chip) designs. It is introduced as a remedy for the challenges introduced by the current interconnects in VLSI chips. NoC design involves decisions at various levels of hierarchy. Architecture selection is one of the most important aspects of NoC design in general and application specific NoC in particular. The paper aims in presenting algorithm for generating optimal topologies with homogeneous routers from a given communication task graph.