Laxman Saha

Orcid: 0000-0003-1563-0841

According to our database1, Laxman Saha authored at least 17 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On inverse symmetric division deg index of graphs.
RAIRO Oper. Res., 2023

2022
Radio k-chromatic Number of Full m-ary Trees.
Theory Comput. Syst., 2022

2021
Improved lower bounds for the radio number of trees.
Theor. Comput. Sci., 2021

Antipodal number of full <i>m</i>-ary trees.
Theor. Comput. Sci., 2021

Metric dimension of ideal-intersection graph of the ring Zn.
AKCE Int. J. Graphs Comb., 2021

Relationship between radio <i>k</i>-chromatic number of graphs and square graphs.
AKCE Int. J. Graphs Comb., 2021

2020
Fault-tolerant metric dimension of circulant graphs <i>C</i><sub><i>n</i></sub>(1, 2, 3).
Theor. Comput. Sci., 2020

Upper bound for radio -chromatic number of graphs in connection with partition of vertex set.
AKCE Int. J. Graphs Comb., 2020

Antipodal Radio Labelling of Full Binary Trees.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
A new graph radio k-coloring algorithm.
Discret. Math. Algorithms Appl., 2019

2015
On the Radio Number of Square of Graphs.
Electron. Notes Discret. Math., 2015

A lower bound for radio k-chromatic number.
Discret. Appl. Math., 2015

2013
On the radio number of toroidal grids.
Australas. J Comb., 2013

2012
Antipodal number of some powers of cycles.
Discret. Math., 2012

A Graph Radio <i>k</i>-Coloring Algorithm.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Improved Lower Bound for Radio Number of an Arbitrary Graph.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Improved Bounds for Radio k-Chromatic Number of Hypercube Qn.
Int. J. Math. Math. Sci., 2011


  Loading...