default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaxman Saha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j14]Zahid Raza, Laxman Saha, Kinkar Chandra Das
:
On inverse symmetric division deg index of graphs. RAIRO Oper. Res. 57(6): 3223-3236 (2023)- 2022
- [j13]Laxman Saha, Alamgir Rahaman Basunia, Satyabrata Das, Kalishankar Tiwary:
Radio k-chromatic Number of Full m-ary Trees. Theory Comput. Syst. 66(1): 114-142 (2022) - 2021
- [j12]Laxman Saha, Mithun Basak, Kalishankar Tiwary:
Metric dimension of ideal-intersection graph of the ring Zn. AKCE Int. J. Graphs Comb. 18(2): 101-105 (2021) - [j11]Laxman Saha:
Relationship between radio k-chromatic number of graphs and square graphs. AKCE Int. J. Graphs Comb. 18(3): 173-179 (2021) - [j10]Daphne Der-Fen Liu, Laxman Saha, Satyabrata Das:
Improved lower bounds for the radio number of trees. Theor. Comput. Sci. 851: 1-13 (2021) - [j9]Alamgir Rahaman Basunia, Satyabrata Das, Laxman Saha, Kalishankar Tiwary:
Antipodal number of full m-ary trees. Theor. Comput. Sci. 885: 131-145 (2021) - 2020
- [j8]Laxman Saha:
Upper bound for radio -chromatic number of graphs in connection with partition of vertex set. AKCE Int. J. Graphs Comb. 17(1): 342-355 (2020) - [j7]Mithun Basak, Laxman Saha, Gour Kanta Das, Kalishankar Tiwary:
Fault-tolerant metric dimension of circulant graphs Cn(1, 2, 3). Theor. Comput. Sci. 817: 66-79 (2020) - 2019
- [j6]Laxman Saha, Pratima Panigrahi:
A new graph radio k-coloring algorithm. Discret. Math. Algorithms Appl. 11(1): 1950005:1-1950005:10 (2019) - 2015
- [j5]Laxman Saha, Pratima Panigrahi:
A lower bound for radio k-chromatic number. Discret. Appl. Math. 192: 87-100 (2015) - [j4]Laxman Saha, Pratima Panigrahi:
On the Radio Number of Square of Graphs. Electron. Notes Discret. Math. 48: 205-212 (2015) - 2013
- [j3]Laxman Saha, Pratima Panigrahi:
On the radio number of toroidal grids. Australas. J Comb. 55: 273-288 (2013) - 2012
- [j2]Laxman Saha, Pratima Panigrahi:
Antipodal number of some powers of cycles. Discret. Math. 312(9): 1550-1557 (2012) - 2011
- [j1]Laxman Saha, Pratima Panigrahi, Pawan Kumar:
Improved Bounds for Radio k-Chromatic Number of Hypercube Qn. Int. J. Math. Math. Sci. 2011: 961649:1-961649:7 (2011)
Conference and Workshop Papers
- 2020
- [c3]Satyabrata Das, Laxman Saha, Kalishankar Tiwary:
Antipodal Radio Labelling of Full Binary Trees. AAIM 2020: 456-468 - 2012
- [c2]Laxman Saha, Pratima Panigrahi:
Improved Lower Bound for Radio Number of an Arbitrary Graph. CTW 2012: 228-231 - [c1]Laxman Saha, Pratima Panigrahi:
A Graph Radio k-Coloring Algorithm. IWOCA 2012: 125-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
