Packing in honeycomb networks

DOI10.1007/s10910-011-9962-9zbMath1407.05197MaRDI QIDQ714696

Albert Muthumalai, A. S. Shanthi, Indra Rajasingh, Rajan Bharati

Publication date: 11 October 2012

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-011-9962-9

zbMATH Keywords

matching; perfect packing; honeycomb network; \(H\)-packing; benzenoid graph

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

The fullerene graphs with a perfect star packing, Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures, Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs, Domination in certain chemical graphs, Domination parameters in coronene torus network

Cites Work

• Unnamed Item
• Packing lines in a hypercube
• An extension of Tutte's 1-factor theorem
• Optimal packing of induced stars in a graph
• Packing of graphs - a survey
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• Packing almost stars into the complete graph
• On the completeness of a generalized matching problem