Packing of hexagonal networks

zbMATH Open1248.05160MaRDI QIDQ3166161FDOQ3166161

Authors: Muthumalai, A. S. Shanthi, Indra Rajasingh 

Publication date: 21 October 2012

Recommendations

• Packing in honeycomb networks
• scientific article; zbMATH DE number 2188612
• Theory of maximum packing and related channel assignment strategies for cellular radio networks
• Theoretical Computer Science
• Maximum hexagon packing of \(K_v-L\) where \(L\) is a 2-regular subgraph.

zbMATH Keywords

maximum packingdynamic channel assignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

Cited In (7)

• The fullerene graphs with a perfect star packing
• Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
• Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
• Packing in honeycomb networks
• Title not available (Why is that?)
• Block allocation of a sequential resource
• Application of neighborhood sequences in communication of hexagonal networks

This page was built for publication: Packing of hexagonal networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166161)