Indra Rajasingh

From MaRDI portal
Person:391308

Available identifiers

zbMath Open rajasingh.indraMaRDI QIDQ391308

List of research outcomes





PublicationDate of PublicationType
On the oriented diameter of planar triangulations2024-11-28Paper
Congestion-sum problem of Petersen graphs into complete binary trees2024-07-03Paper
Bounds for the oriented diameter of planar triangulations2023-08-03Paper
https://portal.mardi4nfdi.de/entity/Q61621902023-06-15Paper
An asymptotic relation between the wirelength of an embedding and the Wiener index2022-11-23Paper
APX-hardness and approximation for the \(k\)-burning number problem2022-09-16Paper
Edge Forcing in Butterfly Networks2022-02-01Paper
Transmission in H-naphtalenic nanosheet2021-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49584662021-09-13Paper
Biochemical and phylogenetic networks. I: Hypertrees and corona products2021-05-10Paper
Biochemical and phylogenetic networks. II: \(X\)-trees and phylogenetic trees2021-05-10Paper
Zero forcing in Benzenoid network2020-12-29Paper
https://portal.mardi4nfdi.de/entity/Q51331622020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51331652020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q49701282020-10-14Paper
Power Domination Parameters in Honeycomb-Like Networks2020-07-02Paper
Domination parameters in hypertrees and sibling trees2020-05-18Paper
A lower bound and several exact results on the \(d\)-lucky number2020-01-15Paper
General transmission lemma and Wiener complexity of triangular grids2019-11-15Paper
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q31343132018-02-09Paper
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees2017-12-15Paper
https://portal.mardi4nfdi.de/entity/Q53550472017-09-06Paper
A note on the locating-total domination in graphs2017-07-17Paper
https://portal.mardi4nfdi.de/entity/Q29753322017-04-11Paper
Total-kernel in oriented circular ladder and Mobius ladder.2016-10-26Paper
\(T\)-coloring of certain networks2016-07-22Paper
Domination Parameters in Hypertrees2016-03-23Paper
Maximum incomplete recursive circulants in graph embeddings2016-02-22Paper
https://portal.mardi4nfdi.de/entity/Q34520602015-11-18Paper
https://portal.mardi4nfdi.de/entity/Q34520382015-11-18Paper
Embeddings Between Hypercubes and Hypertrees2015-10-29Paper
Embedding Circulant Networks into Butterfly and Benes Networks2015-09-15Paper
Bothway embedding of circulant network into grid2015-08-18Paper
Excessive index for mesh derived networks2015-08-18Paper
Linear layout of directed grid graph2015-08-03Paper
Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs2015-08-03Paper
Domination in certain chemical graphs2015-03-19Paper
A Tight Bound for Congestion of an Embedding2015-02-19Paper
Metric dimension of directed graphs2014-12-29Paper
Wiener, Szeged and vertex PI indices of regular tessellations2014-08-20Paper
A linear time algorithm for embedding hypercube into cylinder and torus2014-06-23Paper
Embedding of hypercubes into sibling trees2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q57473902014-02-14Paper
On excessive index of certain networks2014-01-10Paper
Embeddings of circulant networks2013-08-09Paper
https://portal.mardi4nfdi.de/entity/Q53270822013-08-01Paper
https://portal.mardi4nfdi.de/entity/Q53270812013-08-01Paper
https://portal.mardi4nfdi.de/entity/Q49148622013-04-15Paper
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs2013-01-22Paper
Linear wirelength of folded hypercubes2012-12-03Paper
https://portal.mardi4nfdi.de/entity/Q31661632012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31661612012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31661502012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31661602012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31661642012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31661682012-10-21Paper
Packing in honeycomb networks2012-10-11Paper
Landmarks in binary tree derived architectures.2012-10-08Paper
Embedding of hypercubes into necklace, windmill and snake graphs2012-07-25Paper
Minimum wirelength of hypercubes into \(n\)-dimensional grid networks2012-07-25Paper
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength2012-04-30Paper
Minimum metric dimension of silicate networks.2012-04-03Paper
https://portal.mardi4nfdi.de/entity/Q30807172011-03-10Paper
Graph-Theoretic Concepts in Computer Science2010-01-12Paper
Kernel in Oriented Circulant Graphs2009-12-11Paper
Exact wirelength of hypercubes on a grid2009-06-30Paper
Exact wirelength of hypercube layout on \(k\)-cube necklace2009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36207642009-04-14Paper
Rupture degree of mesh and binary trees2009-04-14Paper
An efficient representation of Benes networks and its applications2008-11-18Paper
On minimum metric dimension of honeycomb networks2008-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54476022008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54475992008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54475972008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54417482008-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54417492008-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54417472008-02-15Paper
Embedding of Generalized Wheels into Arbitrary Trees2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34174492007-01-29Paper
Landmarks in torus networks2006-11-16Paper
https://portal.mardi4nfdi.de/entity/Q54634992005-08-04Paper
Graphs with unique minimum acyclic graphoidal cover – I2005-04-22Paper
Embedding of cycles and wheels into arbitrary trees2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q44696042004-06-15Paper
A note on the graphoidal covering number of a graph2003-06-17Paper
Graphs whose acyclic graphoidal covering number is one less than its maximum degree2002-07-22Paper

Research outcomes over time

This page was built for person: Indra Rajasingh