LSLaxman Saha
Laxman Saha
*This is an algorithmically generated author record based on publicly available information.
Laxman Saha has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Kalishankar Tiwary
Department of Mathematics, Raiganj University, Raiganj 733134, India
7 shared publications Kalishankar Tiwary
Department of Mathematics, Raiganj University, Raiganj, India
3 shared publicationsPratima Panigrahi
Department of Mathematics, IIT Kharagpur, Kharagpur Medinipur, West Bengal 721302, India
3 shared publications- Satyabrata Das
Balurghat College
3 shared publications Alamgir Rahaman Basunia
2 shared publications- Alamgir Rahaman Basunia
Balurghat Coll, Dept Math, Balurghat 733101, India
2 shared publications
Latest Publications
- Open Access
On metric dimension of cube of trees
Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$ of $G$, there exist an element $s\in S$ such that $d(s,u)\neq d(s,v)$. The minimum cardinality of a resolving set for a graph $G$ is called the {\em metric dimension} of $G$ and it is denoted by $β{(G)}$. A resolving set having $β{(G)}$ number of vertices is named as {\em metric basis} of $G$. The metric dimension problem is to find a metric basis in a graph $G$, and it has several real-life applications in network theory, telecommunication, image processing, pattern recognition, and many other fields. In this article, we consider {\em cube of trees} $T^{3}=(V, E)$, where any two vertices $u,v$ are adjacent if and only if the distance between them is less than equal to three in $T$. We establish the necessary and sufficient conditions of a vertex subset of $V$ to become a resolving set for $T^{3}$. This helps determine the tight bounds (upper and lower) for the metric dimension of $T^{3}$. Then, for certain well-known cubes of trees, such as caterpillars, lobsters, spiders, and $d$-regular trees, we establish the boundaries of the metric dimension. Further, we characterize some restricted families of cube of trees satisfying $β{(T^{3})}=β{(T)}$. We provide a construction showing the existence of a cube of tree attaining every positive integer value as their metric dimension.Open AccessOn metric dimension of cube of trees
Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$ of $G$, there exist an element $s\in S$ such that $d(s,u)\neq d(s,v)$. The minimum cardinality of a resolving set for a graph $G$ is called the {\em metric dimension} of $G$ and it is denoted by $β{(G)}$. A resolving set having $β{(G)}$ number of vertices is named as {\em metric basis} of $G$. The metric dimension problem is to find a metric basis in a graph $G$, and it has several real-life applications in network theory, telecommunication, image processing, pattern recognition, and many other fields. In this article, we consider {\em cube of trees} $T^{3}=(V, E)$, where any two vertices $u,v$ are adjacent if and only if the distance between them is less than equal to three in $T$. We establish the necessary and sufficient conditions of a vertex subset of $V$ to become a resolving set for $T^{3}$. This helps determine the tight bounds (upper and lower) for the metric dimension of $T^{3}$. Then, for certain well-known cubes of trees, such as caterpillars, lobsters, spiders, and $d$-regular trees, we establish the boundaries of the metric dimension. Further, we characterize some restricted families of cube of trees satisfying $β{(T^{3})}=β{(T)}$. We provide a construction showing the existence of a cube of tree attaining every positive integer value as their metric dimension. - 1 October 2023
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 91 (2) , 533-551
Relations between p-Sombor and Other Degree-Based Indices
- 1 October 2023
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 91 (2) , 533-551
Relations between p-Sombor and Other Degree-Based Indices
- Open Access
- 13 March 2023
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 55 (1) , 15-23
A different approach for multi-level distance labellings of path structure networks
For a positive integer $k$, a radio $k$-labelling of a simple connected graph $G=(V, E)$ is a mapping $f$ from the vertex set $V(G)$ to a set of non-negative integers such that $|f(u)-f(v)|\geqslant k+1-d(u,v)$ for each pair of distinct vertices $u$ and $v$ of $G$, where $d(u,v)$ is the distance between $u$ and $v$ in $G$. The \emph{span} of a radio $k$-coloring $f$, denoted by $span_f(G)$, is defined as $\displaystyle\max_{v\in V(G)}f(v)$ and the \emph{radio $k$-chromatic number of $G$}, denoted by $rc_k(G)$, is $\displaystyle\min_{f}\{~span_f(G)\}$ where the minimum is taken over all radio $k$-labellings of $G$. In this article, we present results of radio $k$-chromatic number of path $P_n$ for $k\in\{n-1, n-2,n-3\}$ in different approach but simple way.- 13 March 2023
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 55 (1) , 15-23
Open AccessA different approach for multi-level distance labellings of path structure networks
For a positive integer $k$, a radio $k$-labelling of a simple connected graph $G=(V, E)$ is a mapping $f$ from the vertex set $V(G)$ to a set of non-negative integers such that $|f(u)-f(v)|\geqslant k+1-d(u,v)$ for each pair of distinct vertices $u$ and $v$ of $G$, where $d(u,v)$ is the distance between $u$ and $v$ in $G$. The \emph{span} of a radio $k$-coloring $f$, denoted by $span_f(G)$, is defined as $\displaystyle\max_{v\in V(G)}f(v)$ and the \emph{radio $k$-chromatic number of $G$}, denoted by $rc_k(G)$, is $\displaystyle\min_{f}\{~span_f(G)\}$ where the minimum is taken over all radio $k$-labellings of $G$. In this article, we present results of radio $k$-chromatic number of path $P_n$ for $k\in\{n-1, n-2,n-3\}$ in different approach but simple way. - Open Access
- 13 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2445
On the Characterization of a Minimal Resolving Set for Power of Paths
For a simple connected graph , an ordered set , 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 . 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 . In this article, we determine the metric dimension of power of finite paths and characterize all metric bases for the same.- 13 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2445
Open AccessOn the Characterization of a Minimal Resolving Set for Power of Paths
For a simple connected graph , an ordered set , 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 . 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 . In this article, we determine the metric dimension of power of finite paths and characterize all metric bases for the same. - 1 April 2022
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 88 (3) , 593-603
Lanzhou Index of Trees with Fixed Maximum and Second Maximum Degree
- 1 April 2022
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 88 (3) , 593-603
Lanzhou Index of Trees with Fixed Maximum and Second Maximum Degree
- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
- Vol. 42 (1) , 93-111
All metric bases and fault-tolerant metric dimension for square of grid
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.- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
- Vol. 42 (1) , 93-111
All metric bases and fault-tolerant metric dimension for square of grid
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.- Open Access
- 2 September 2021
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 18 (3) , 173-179
Relationship between radio k-chromatic number of graphs and square graphs
Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed as the span of f, and is denoted by The minimum span amongst all radio k-labelings of G is the radio k-chromatic number of G and it is denoted by In this article, we investigate a relationship between the radio k-chromatic number of an arbitrary graph and its square graph. This investigation leads us to the exact value of the radio number for square of graphs with small triameter.- 2 September 2021
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 18 (3) , 173-179
Open AccessRelationship between radio k-chromatic number of graphs and square graphs
Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed as the span of f, and is denoted by The minimum span amongst all radio k-labelings of G is the radio k-chromatic number of G and it is denoted by In this article, we investigate a relationship between the radio k-chromatic number of an arbitrary graph and its square graph. This investigation leads us to the exact value of the radio number for square of graphs with small triameter. - 1 September 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 885, 131-145
Antipodal number of full m-ary trees
- 1 September 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 885, 131-145
Antipodal number of full m-ary trees
- 2 August 2021
- Published by Springer Nature in Theory of Computing Systems
- Vol. 66 (1) , 114-142
Radio k-chromatic Number of Full m-ary Trees
- 2 August 2021
- Published by Springer Nature in Theory of Computing Systems
- Vol. 66 (1) , 114-142
Radio k-chromatic Number of Full m-ary Trees
- Open Access
- 4 May 2021
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 18 (2) , 101-105
Metric dimension of ideal-intersection graph of the ring Zn
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n being a positive integer.- 4 May 2021
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 18 (2) , 101-105
Open AccessMetric dimension of ideal-intersection graph of the ring Zn
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n being a positive integer.