Conditional resolvability of honeycomb and hexagonal networks

DOI10.1007/s11786-011-0076-3zbMath1254.05055OpenAlexW2012795607MaRDI QIDQ691636

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

zbMATH Keywords

basisresolving setresolving numberhoneycomb and hexagonal networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Combinatorial aspects of tessellation and tiling problems (05B45) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Fuzzy resolving number and real basis generating fuzzy graphs

Cites Work

• An efficient representation of Benes networks and its applications
• On minimum metric dimension of honeycomb networks
• Resolvability in graphs and the metric dimension of a graph
• Two-dimensional regular \(d\)-meshes
• Conditional resolvability in graphs: a survey
• Landmarks in graphs
• Landmarks in torus networks
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• On Metric Generators of Graphs
• A Combinatory Detection Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conditional resolvability of honeycomb and hexagonal networks