Packing of hexagonal networks

MaRDI QIDQ3166161zbMATH OpenFDO

Authors Muthumalai, A. S. Shanthi, Indra Rajasingh

Publication date 21 October 2012

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)

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.

Cited in

(7)

• Packing in honeycomb networks
• Block allocation of a sequential resource
• Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
• scientific article; zbMATH DE number 4057528 (Why is no real title available?)
• Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
• Application of neighborhood sequences in communication of hexagonal networks
• The fullerene graphs with a perfect star packing

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)