Application of neighborhood sequences in communication of hexagonal networks
DOI10.1016/J.DAM.2015.10.034zbMATH Open1361.05124OpenAlexW2172893619MaRDI QIDQ528338FDOQ528338
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
Recommendations
communicationhexagonal networkneighborhood sequencesdigital discsdigital distancesvarious signal speed
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Communication, information (94A99)
Cites Work
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- Distances defined by neighborhood sequences
- Combinatorial Image Analysis
- Distance functions in digital geometry
- Generalized distances in digital geometry
- Title not available (Why is that?)
- Broadcasting Automata and Patterns on ℤ2
- Geometry of Neighborhood Sequences in Hexagonal Grid
- Distance functions defined by variable neighbourhood sequences
Cited In (2)
This page was built for publication: Application of neighborhood sequences in communication of hexagonal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528338)