On minimum metric dimension of honeycomb networks

DOI10.1016/J.JDA.2006.09.002zbMATH Open1159.05308OpenAlexW2015569852MaRDI QIDQ954950FDOQ954950

Authors: R. Bharati, Indra Rajasingh, Chris Monica M, Paul Manuel 

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.09.002

Recommendations

• scientific article
• Minimum metric dimension of Illiac networks.
• A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
• Honeycomb networks
• Metric basis in circulant networks.

zbMATH Keywords

metric dimensionhexagonal networkhoneycomb networkmetric basisdual of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Higher dimensional hexagonal networks
• Title not available (Why is that?)
• Landmarks in graphs
• Metric bases in digital geometry
• Landmarks in torus networks
• Title not available (Why is that?)

Cited In (40)

• Comparative analysis of \(M\)-polynomial based topological indices between poly hex-derived networks and its subdivision
• On some plane graphs and their metric dimension
• Conditional resolvability of honeycomb and hexagonal networks
• Title not available (Why is that?)
• Computing the metric dimension of gear graphs
• The local metric dimension of amalgamation of graphs
• On the metric dimension of HDN
• Computation of topological indices of certain networks
• Radial radio number of hexagonal and its derived networks
• On metric dimensions of symmetric graphs obtained by rooted product
• On the fault-tolerant metric dimension of certain interconnection networks
• On metric dimension of subdivided honeycomb network and Aztec diamond network
• Title not available (Why is that?)
• Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
• On the metric dimension of circulant and Harary graphs
• Locating Number of Biswapped Networks
• Minimum metric dimension of Illiac networks.
• An efficient representation of Benes networks and its applications
• Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
• Metric dimension of directed graphs
• Erdös-Gallai-type problems for distance-edge-monitoring numbers
• The fault‐tolerant beacon set of hexagonal Möbius ladder network
• The metric dimension of comb product graphs
• The locating number of hexagonal Möbius ladder network
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• Hamiltonian properties of enhanced honeycomb networks
• Computing the upper bounds for the metric dimension of cellulose network
• Vertex-bipancyclicity of the generalized honeycomb tori
• Computation of edge resolvability of benzenoid tripod structure
• On the bounded partition dimension of some classes of convex polytopes
• Computing topological indices of sudoku graphs
• Unraveling the enigmatic irregular coloring of honeycomb networks
• On the strong metric dimension of tetrahedral diamond lattice
• Fault-tolerant strong metric dimension of graphs
• Minimum metric dimension of silicate networks.
• On the Hosoya polynomial of the third type of the chain hex-derived network
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• Routing algorithms in honeycomb meshes
• Title not available (Why is that?)
• On the \(k\)-partition dimension of graphs

This page was built for publication: On minimum metric dimension of honeycomb networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954950)