Application of neighborhood sequences in communication of hexagonal networks

DOI10.1016/J.DAM.2015.10.034zbMath1361.05124OpenAlexW2172893619MaRDI QIDQ528338

Benedek Nagy

Publication date: 12 May 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.034

zbMATH Keywords

communicationhexagonal networkneighborhood sequencesdigital discsdigital distancesvarious signal speed

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication, information (94A99) Distance in graphs (05C12)

Related Items (2)

Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach

Cites Work

• Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
• Distance functions defined by variable neighbourhood sequences
• Distances defined by neighborhood sequences
• Distance functions in digital geometry
• Generalized distances in digital geometry
• Broadcasting Automata and Patterns on ℤ2
• Geometry of Neighborhood Sequences in Hexagonal Grid
• Combinatorial Image Analysis
• Unnamed Item

This page was built for publication: Application of neighborhood sequences in communication of hexagonal networks