Indra Rajasingh

Hossein Rashmanlou

RAIRO Theor. Informatics Appl., 2025

2024

On the oriented diameter of planar triangulations.

[BibT_eX]

[DOI]

Debajyoti Mondal

N. Parthiban

J. Comb. Optim., July, 2024

2023

2-power domination number for Knödel graphs and its application in communication networks.

[BibT_eX]

[DOI]

RAIRO Oper. Res., November, 2023

2022

APX-hardness and approximation for the <i>k</i>-burning number problem.

[BibT_eX]

[DOI]

Debajyoti Mondal

Angelin Jemima Rajasingh

N. Parthiban

Theor. Comput. Sci., 2022

Bounds for the Oriented Diameter of Planar Triangulations.

[BibT_eX]

[DOI]

Debajyoti Mondal

N. Parthiban

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021

Induced H-packing k-partition of graphs.

[BibT_eX]

[DOI]

S. Maria Jesu Raja

Antony Xavier

Int. J. Comput. Math. Comput. Syst. Theory, 2021

Optimal layout of recursive circulant graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2021

Edge Forcing in Butterfly Networks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Transmission in H-naphtalenic nanosheet.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

APX-Hardness and Approximation for the k-Burning Number Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory.

[BibT_eX]

[DOI]

Krishnan Balasubramanian

Symmetry, 2020

Domination parameters in hypertrees and sibling trees.

[BibT_eX]

[DOI]

R. Jayagopal

Discret. Appl. Math., 2020

A lower bound and several exact results on the <i>d</i>-lucky number.

[BibT_eX]

[DOI]

Sandi Klavzar

D. Ahima Emilet

Appl. Math. Comput., 2020

2018

General Transmission Lemma and Wiener complexity of triangular grids.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

Exact wirelength of embedding chord graph into tree-based architectures.

[BibT_eX]

[DOI]

Int. J. Netw. Virtual Organisations, 2017

Embedding complete bipartite graph into grid with optimum congestion and wirelength.

[BibT_eX]

[DOI]

A. Berin Greeni

Int. J. Netw. Virtual Organisations, 2017

Induced H-packing k-partition problem in interconnection networks.

[BibT_eX]

[DOI]

S. Maria Jesu Raja

Antony Xavier

Int. J. Comput. Math. Comput. Syst. Theory, 2017

A note on the locating-total domination in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs.

[BibT_eX]

Ars Comb., 2017

Embedding of Hypercubes into Generalized Books.

[BibT_eX]

Ars Comb., 2017

2016

T-Coloring of Certain Networks.

[BibT_eX]

[DOI]

P. Sivagami

Math. Comput. Sci., 2016

Transmission in Butterfly Networks.

[BibT_eX]

[DOI]

Comput. J., 2016

Total-Kernel in Oriented Circular Ladder and Mobius Ladder.

[BibT_eX]

Ars Comb., 2016

Domination Parameters in Hypertrees.

[BibT_eX]

[DOI]

R. Jayagopal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2015

Linear Layout of Directed Grid Graph.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2015

Total Vertex Irregularity Strength of 1-Fault Tolerant Hamiltonian Graphs.

[BibT_eX]

[DOI]

V. Annamma

Math. Comput. Sci., 2015

Foreword.

[BibT_eX]

[DOI]

Mirka Miller

Math. Comput. Sci., 2015

Embeddings Between Hypercubes and Hypertrees.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Excessive index for mesh derived networks.

[BibT_eX]

[DOI]

A. S. Shanthi

Albert Muthumalai

J. Discrete Algorithms, 2015

Bothway embedding of circulant network into grid.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Maximum incomplete recursive circulants in graph embeddings.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2015

Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees.

[BibT_eX]

[DOI]

Discret. Optim., 2015

A Lower Bound for Dilation of an Embedding.

[BibT_eX]

[DOI]

Comput. J., 2015

Minimum Linear Arrangement of Incomplete Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 2015

A Tight Bound for Congestion of an Embedding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

A linear time algorithm for embedding hypercube into cylinder and torus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Metric dimension of directed graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

Embedding of hypercubes into sibling trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Investigating substructures in goal oriented online communities: Case Study of Ubuntu IRC.

[BibT_eX]

[DOI]

Tanmay Sinha

CoRR, 2014

Minimum Metric Dimension of Illiac Networks.

[BibT_eX]

Ars Comb., 2014

Embedding Circulant Networks into Butterfly and Benes Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

On excessive index of certain networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Layout of Embedding Circulant Networks into Linear Hexagons and Phenylenes.

[BibT_eX]

[DOI]

Micheal Arockiaraj

J. Interconnect. Networks, 2013

Embeddings of circulant networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Improved Bounds on the Crossing Number of Butterfly Network.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

2012

Embedding Variants of Hypercubes with Dilation 2.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2012

Embedding of hypercubes into necklace, windmill and snake graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Minimum wirelength of hypercubes into n-dimensional grid networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2012

Wirelength of hypercubes into certain trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Spectrum of Sierpiński triangles using MATLAB.

[BibT_eX]

[DOI]

Proceedings of the 2012 Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP), 2012

Energy of grid based networks using MATLAB.

[BibT_eX]

[DOI]

Proceedings of the 2012 Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP), 2012

2011

Linear Wirelength of Folded Hypercubes.

[BibT_eX]

[DOI]

Micheal Arockiaraj

Math. Comput. Sci., 2011

Circular wirelength of Generalized Petersen Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2011

Wirelength of 1-fault hamiltonian graphs into wheels and fans.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Landmarks in Binary Tree Derived Architectures.

[BibT_eX]

Ars Comb., 2011

Minimum Metric Dimension of Silicate Networks.

[BibT_eX]

Ars Comb., 2011

2009

Exact wirelength of hypercubes on a grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Kernel in Oriented Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

On minimum metric dimension of honeycomb networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

An efficient representation of Benes networks and its applications.

[BibT_eX]

[DOI]

Mostafa I. Abd-El-Barr

J. Discrete Algorithms, 2008

2006

On Induced Matching Partitions of Certain Interconnection Networks.

[BibT_eX]

Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2004

Embedding of cycles and wheels into arbitrary trees.

[BibT_eX]

[DOI]

Networks, 2004

On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.

[BibT_eX]

S. Arumugam

P. Roushini Leely Pushpam

Ars Comb., 2004

2003

Embedding of Generalized Wheels into Arbitrary Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2001

Graphs whose acyclic graphoidal covering number is one less than its maximum degree.

[BibT_eX]

[DOI]

S. Arumugam