Conditional resolvability of honeycomb and hexagonal networks
From MaRDI portal
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5543386 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (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 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2148779 (Why is no real title available?)
- A Combinatory Detection Problem
- An efficient representation of Benes networks and its applications
- Conditional resolvability in graphs: a survey
- Landmarks in binary tree derived architectures.
- Landmarks in graphs
- Landmarks in torus networks
- Metric bases in digital geometry
- Minimum metric dimension of Illiac networks.
- On Metric Generators of Graphs
- On minimum metric dimension of honeycomb networks
- Resolvability in graphs and the metric dimension of a graph
- Structure-activity maps for visualizing the graph variables arising in drug design
- Two-dimensional regular \(d\)-meshes
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)