Laxman Saha

Dr. Laxman Saha

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2020 in Theoretical Computer Science
Verified
Journal Article
Closed access
MBMithun Basak
Mithun Basak
LSLaxman Saha
Laxman Saha
GDGour Kanta Das
Gour Kanta Das
KTKalishankar Tiwary
Kalishankar Tiwary

1 September 2015 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
LSLaxman Saha
Laxman Saha
PPPratima Panigrahi
Pratima Panigrahi

6 May 2012 in Discrete Mathematics
Verified
Journal Article
Closed access
LSLaxman Saha
Laxman Saha
PPPratima Panigrahi
Pratima Panigrahi

1 January 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
LSLaxman Saha
Laxman Saha
For a simple connected graph G = (V (G), E(G)), a set R ⊆ V (G) is said to be a resolving set of G if every pair of vertices of G are resolved by some vertices in R i.e., every pair of vertices of G are identified uniquely by some vertex elements in F. A resolving set of G containing the minimum number of vertices is the metric basis and the minimum cardinality of the metric basis is called the metric dimension of G. A resolving set F for the graph G is said to be fault tolerant if for each u ∈ F, F \ {u} is also a resolving set for G and the minimum cardinality of the fault-tolerant resolving set said to be the fault-tolerant metric dimension. In this article, we determine the exact value of fault-tolerant metric dimension of P n 3 .

13 July 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
LSLaxman Saha
Laxman Saha
MBMithun Basak
Mithun Basak
KTKalishankar Tiwary
Kalishankar Tiwary
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Yilun ShangYilun Shang
Yilun Shang
For a simple connected graph G=(V,E), an ordered set W⊆V, is called a resolving set of G if for every pair of two distinct vertices u and v, there is an element w in W such that d(u,w)≠d(v,w). A metric basis of G is a resolving set of G with minimum cardinality. The metric dimension of G is the cardinality of a metric basis and it is denoted by β(G). In this article, we determine the metric dimension of power of finite paths and characterize all metric bases for the same.

1 January 2022 in Opuscula Mathematica
Verified
Journal Article
Closed access
LSLaxman Saha
Laxman Saha
MBMithun Basak
Mithun Basak
KTKalishankar Tiwary
Kalishankar Tiwary
For a simple connected graph \(G=(V,E)\) and an ordered subset \(W = \{w_1,w_2,\ldots, w_k\}\) of \(V\), the code of a vertex \(v\in V\), denoted by \(\mathrm{code}(v)\), with respect to \(W\) is a \(k\)-tuple \((d(v,w_1),\ldots, d(v, w_k))\), where \(d(v, w_t)\) represents the distance between \(v\) and \(w_t\). The set \(W\) is called a resolving set of \(G\) if \(\mathrm{code}(u)\neq \mathrm{code}(v)\) for every pair of distinct vertices \(u\) and \(v\). A metric basis of \(G\) is a resolving set with the minimum cardinality. The metric dimension of \(G\) is the cardinality of a metric basis and is denoted by \(\beta(G)\). A set \(F\subset V\) is called fault-tolerant resolving set of \(G\) if \(F\setminus{\{v\}}\) is a resolving set of \(G\) for every \(v\in F\). The fault-tolerant metric dimension of \(G\) is the cardinality of a minimal fault-tolerant resolving set. In this article, a complete characterization of metric bases for \(G_{mn}^2\) has been given. In addition, we prove that the fault-tolerant metric dimension of \(G_{mn}^2\) is 4 if \(m+n\) is even. We also show that the fault-tolerant metric dimension of \(G_{mn}^2\) is at least 5 and at most 6 when \(m+n\) is odd.