Indra Rajasingh

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 37

Top Topics

Robust Image Watermarking

Graph Embedding

Cartesian Product

Top Venues

Math. Comput. Sci.

Appl. Math. Comput.

Publications

Debajyoti Mondal, N. Parthiban, Indra Rajasingh
On the oriented diameter of planar triangulations. J. Comb. Optim. 47 (5) (2024)
R. Sundara Rajan, S. Arulanand, S. Prabhu, Indra Rajasingh
2-power domination number for Knödel graphs and its application in communication networks. RAIRO Oper. Res. 57 (6) (2023)
Debajyoti Mondal, N. Parthiban, Indra Rajasingh
Oriented Diameter of Planar Triangulations. CoRR (2022)
Debajyoti Mondal, N. Parthiban, Indra Rajasingh
Bounds for the Oriented Diameter of Planar Triangulations. FAW (2022)
Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, Indra Rajasingh
-burning number problem. Theor. Comput. Sci. 932 (2022)
R. Stalin Mary, N. Parthiban, Indra Rajasingh, Paul D. Manuel
Optimal layout of recursive circulant graphs. Int. J. Comput. Math. Comput. Syst. Theory 6 (3) (2021)
Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh
Transmission in H-naphtalenic nanosheet. Appl. Math. Comput. 406 (2021)
Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh
APX-Hardness and Approximation for the k-Burning Number Problem. WALCOM (2021)
G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan
Edge Forcing in Butterfly Networks. Fundam. Informaticae 182 (3) (2021)
S. Maria Jesu Raja, Indra Rajasingh, Antony Xavier
Induced H-packing k-partition of graphs. Int. J. Comput. Math. Comput. Syst. Theory 6 (2) (2021)
Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh
APX-Hardness and Approximation for the k-Burning Number Problem. CoRR (2020)
G. Kirithiga Nandini, R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian
Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory. Symmetry 12 (12) (2020)
Sandi Klavzar, Indra Rajasingh, D. Ahima Emilet
-lucky number. Appl. Math. Comput. 366 (2020)
Indra Rajasingh, R. Jayagopal, R. Sundara Rajan
Domination parameters in hypertrees and sibling trees. Discret. Appl. Math. 280 (2020)
Sandi Klavzar, D. Azubha Jemilet, Indra Rajasingh, Paul D. Manuel, N. Parthiban
General Transmission Lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338 (2018)
R. Sundara Rajan, R. Jayagopal, Paul D. Manuel, Mirka Miller, Indra Rajasingh
A note on the locating-total domination in graphs. Discuss. Math. Graph Theory 37 (3) (2017)
A. Berin Greeni, Indra Rajasingh
Embedding complete bipartite graph into grid with optimum congestion and wirelength. Int. J. Netw. Virtual Organisations 17 (1) (2017)
S. Maria Jesu Raja, Antony Xavier, Indra Rajasingh
Induced H-packing k-partition problem in interconnection networks. Int. J. Comput. Math. Comput. Syst. Theory 2 (4) (2017)
Indra Rajasingh, R. Sundara Rajan
Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs. Ars Comb. 130 (2017)
R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir
Embedding of Hypercubes into Generalized Books. Ars Comb. 135 (2017)
N. Parthiban, Joe Ryan, Indra Rajasingh, R. Sundara Rajan, L. Nirmala Rani
Exact wirelength of embedding chord graph into tree-based architectures. Int. J. Netw. Virtual Organisations 17 (1) (2017)
R. Jayagopal, Indra Rajasingh, R. Sundara Rajan
Domination Parameters in Hypertrees. CALDAM (2016)
P. Sivagami, Indra Rajasingh
T-Coloring of Certain Networks. Math. Comput. Sci. 10 (2) (2016)
Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan
Transmission in Butterfly Networks. Comput. J. 59 (8) (2016)
Indra Rajasingh, Bharati Rajan, Joice Punitha, Paul D. Manuel
Total-Kernel in Oriented Circular Ladder and Mobius Ladder. Ars Comb. 126 (2016)
Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi
A Tight Bound for Congestion of an Embedding. CALDAM (2015)
Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi
Bothway embedding of circulant network into grid. J. Discrete Algorithms 33 (2015)
Mirka Miller, R. Sundara Rajan, N. Parthiban, Indra Rajasingh
Minimum Linear Arrangement of Incomplete Hypercubes. Comput. J. 58 (2) (2015)
Indra Rajasingh, V. Annamma
Total Vertex Irregularity Strength of 1-Fault Tolerant Hamiltonian Graphs. Math. Comput. Sci. 9 (2) (2015)
Mirka Miller, Bharati Rajan, Indra Rajasingh
Foreword. Math. Comput. Sci. 9 (2) (2015)
Indra Rajasingh, R. Sundara Rajan, Paul D. Manuel
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees. Parallel Process. Lett. 25 (4) (2015)
Indra Rajasingh, A. S. Shanthi, Albert Muthumalai
Excessive index for mesh derived networks. J. Discrete Algorithms 33 (2015)
R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19 (1) (2015)
Indra Rajasingh, Micheal Arockiaraj, Jasintha Quadras, Arul Jeya Shalini
Linear Layout of Directed Grid Graph. Math. Comput. Sci. 9 (2) (2015)
R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, Mirka Miller, T. M. Rajalaxmi
Maximum incomplete recursive circulants in graph embeddings. Discret. Math. Algorithms Appl. 7 (4) (2015)
R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh, N. Parthiban, Mirka Miller
A Lower Bound for Dilation of an Embedding. Comput. J. 58 (12) (2015)
Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees. Discret. Optim. 17 (2015)
Bharati Rajan, Indra Rajasingh, P. Venugopal, Chris Monica M.
Minimum Metric Dimension of Illiac Networks. Ars Comb. 117 (2014)
Tanmay Sinha, Indra Rajasingh
Investigating substructures in goal oriented online communities: Case Study of Ubuntu IRC. CoRR (2014)
Bharati Rajan, Indra Rajasingh, Jude Annie Cynthia, Paul D. Manuel
Metric dimension of directed graphs. Int. J. Comput. Math. 91 (7) (2014)
Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini
Embedding of hypercubes into sibling trees. Discret. Appl. Math. 169 (2014)
R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban
Embedding Circulant Networks into Butterfly and Benes Networks. IWOCA (2014)
R. Sundara Rajan, Indra Rajasingh, N. Parthiban, T. M. Rajalaxmi
A linear time algorithm for embedding hypercube into cylinder and torus. Theor. Comput. Sci. 542 (2014)
Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan
Embeddings of circulant networks. J. Comb. Optim. 26 (1) (2013)
Indra Rajasingh, Micheal Arockiaraj
Layout of Embedding Circulant Networks into Linear Hexagons and Phenylenes. J. Interconnect. Networks 14 (3) (2013)
Indra Rajasingh, Bharati Rajan, Albert Muthumalai, A. S. Shanthi
On excessive index of certain networks. Theor. Comput. Sci. 501 (2013)
Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah
Improved Bounds on the Crossing Number of Butterfly Network. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int. J. Comput. Math. 89 (15) (2012)
Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Embedding of hypercubes into necklace, windmill and snake graphs. Inf. Process. Lett. 112 (12) (2012)
Bharati Rajan, Indra Rajasingh, Sudeep Stephen, Cyriac Grigorious
Spectrum of Sierpiński triangles using MATLAB. DICTAP (2012)
Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel
Minimum wirelength of hypercubes into n-dimensional grid networks. Inf. Process. Lett. 112 (14-15) (2012)
Indra Rajasingh, Paul D. Manuel, Bharati Rajan, Micheal Arockiaraj
Wirelength of hypercubes into certain trees. Discret. Appl. Math. 160 (18) (2012)
Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan
Embedding Variants of Hypercubes with Dilation 2. J. Interconnect. Networks 13 (1-2) (2012)
Bharati Rajan, Indra Rajasingh, Cyriac Grigorious, Sudeep Stephen
Energy of grid based networks using MATLAB. DICTAP (2012)
Indra Rajasingh, Micheal Arockiaraj
Linear Wirelength of Folded Hypercubes. Math. Comput. Sci. 5 (1) (2011)
Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.
Landmarks in Binary Tree Derived Architectures. Ars Comb. 99 (2011)
Micheal Arockiaraj, Paul D. Manuel, Indra Rajasingh, Bharati Rajan
Wirelength of 1-fault hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111 (18) (2011)
Paul D. Manuel, Indra Rajasingh
Minimum Metric Dimension of Silicate Networks. Ars Comb. 98 (2011)
Paul D. Manuel, Micheal Arockiaraj, Indra Rajasingh, Bharati Rajan
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159 (17) (2011)
Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel
Circular wirelength of Generalized Petersen Graphs. J. Interconnect. Networks 12 (4) (2011)
Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha
Kernel in Oriented Circulant Graphs. IWOCA (2009)
Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy
Exact wirelength of hypercubes on a grid. Discret. Appl. Math. 157 (7) (2009)
Paul D. Manuel, Mostafa I. Abd-El-Barr, Indra Rajasingh, Bharati Rajan
An efficient representation of Benes networks and its applications. J. Discrete Algorithms 6 (1) (2008)
Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.
On minimum metric dimension of honeycomb networks. J. Discrete Algorithms 6 (1) (2008)
Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Albert Muthumalai
On Induced Matching Partitions of Certain Interconnection Networks. FCS (2006)
S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam
On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number. Ars Comb. 72 (2004)
Indra Rajasingh, Albert William, Jasintha Quadras, Paul D. Manuel
Embedding of cycles and wheels into arbitrary trees. Networks 44 (3) (2004)
Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. WG (2003)
Albert William, Indra Rajasingh, Jasintha Quadras, Paul D. Manuel
Embedding of Generalized Wheels into Arbitrary Trees. Electron. Notes Discret. Math. 15 (2003)
S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam
Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discret. Math. 240 (1-3) (2001)