Biblio Discovery — Demo Discovery Service

3 hasil untuk "Mithun Basak"

Menampilkan 1–3 · 0,51 detik · RSS

  1. Artikel Jurnal

    Metric dimension of ideal-intersection graph of the ring

    Laxman Saha; Mithun Basak; Kalishankar Tiwary

    AKCE International Journal of Graphs and Combinatorics, Vol. 18 No. 2 · 2021 · Inggris · DOAJ Scopus

    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.

  2. Artikel Jurnal Teks lengkap

    All metric bases and fault-tolerant metric dimension for square of grid

    Laxman Saha; Mithun Basak; Kalishankar Tiwary

    Opuscula Mathematica, Vol. 42 No. 1 · 2022 · Inggris · DOAJ Scopus

    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…

  3. Artikel Jurnal Teks lengkap

    On the Characterization of a Minimal Resolving Set for Power of Paths

    Laxman Saha; Mithun Basak; Kalishankar Tiwary dkk.

    Mathematics, Vol. 10 No. 14 · 2022 · Inggris · DOAJ Scopus

    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…