Conditional resolvability of honeycomb and hexagonal networks
DOI10.1007/S11786-011-0076-3zbMATH Open1254.05055OpenAlexW2012795607MaRDI QIDQ691636FDOQ691636
Authors: M. C. Fu 
Publication date: 3 December 2012
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-011-0076-3
Recommendations
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of tessellation and tiling problems (05B45) Distance in graphs (05C12) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Landmarks in graphs
- Metric bases in digital geometry
- Title not available (Why is that?)
- Structure-activity maps for visualizing the graph variables arising in drug design
- On Metric Generators of Graphs
- An efficient representation of Benes networks and its applications
- On minimum metric dimension of honeycomb networks
- Landmarks in binary tree derived architectures.
- Landmarks in torus networks
- Conditional resolvability in graphs: a survey
- A Combinatory Detection Problem
- Two-dimensional regular \(d\)-meshes
- Minimum metric dimension of Illiac networks.
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Conditional resolvability of honeycomb and hexagonal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691636)
