Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
Summary: Concepts of resolving set and metric basis has enjoyed a lot of success because of multi-purpose applications both in computer and mathematical sciences. For a connected graph G(V,E) a subset W of V(G) is a resolving set for G if every two vertices of G have distinct representations with respect to W. A resolving set of minimum cardinality is called a metric basis for graph G and this minimum cardinality is known as metric dimension of G. Boron nanotubes with different lattice structures, radii and chirality's have attracted attention due to their transport properties, electronic structure and structural stability. In the present article, we compute the metric dimension and metric basis of 2D lattices of alpha-boron nanotubes.
- Some computational aspects of boron triangular nanotubes
- Computation of certain topological indices for 2D nanotubes
- An exact polyhedral model for boron nanotubes
- On computation of face index of certain nanotubes
- scientific article; zbMATH DE number 7066374
- Topological aspects of boron triangular nanotube and boron- nanotube. II
- Two types of geometric-arithmetic indices of nanotubes and nanotori
- Distance based indices in nanotubical graphs. II
- Computing some topological indices of carbon nanotubes
- Analyzing the boron triangular nanotube through topological indices via \(M\)-polynomial
- Computing the metric dimension of gear graphs
- Computing the metric dimension of wheel related graphs
- Families of regular graphs with constant metric dimension
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- Landmarks in graphs
- Mastermind
- Metric dimension of the Möbius ladder.
- On \(k\)-dimensional graphs and their bases
- On metric dimension of generalized Petersen graphs P(n,3).
- On Metric Generators of Graphs
- On minimum metric dimension of honeycomb networks
- On the Metric Dimension of Cartesian Products of Graphs
- On the metric dimension of circulant and Harary graphs
- On the metric dimension of circulant graphs
- On the metric dimension of Möbius ladders.
- On the metric dimension of some families of graphs
- On the metric dimension of the Jahangir graph
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- The metric dimension of regular bipartite graphs
- Sharp bounds for partition dimension of generalized Möbius ladders
- Computation of edge resolvability of benzenoid tripod structure
- Computing a metric basis of a bipartite distance-hereditary graph
- Some computational aspects of boron triangular nanotubes
- Partition dimension of COVID antiviral drug structures
- On metric dimension of carbon nanotube Y-junctions
- Novel resolvability parameter of some well-known graphs and exchange properties with applications
This page was built for publication: Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333632)