Packing in honeycomb networks
DOI10.1007/S10910-011-9962-9zbMATH Open1407.05197OpenAlexW1993405918MaRDI QIDQ714696FDOQ714696
Authors: Indra Rajasingh, Muthumalai, A. S. Shanthi, R. 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
Recommendations
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Optimal packing of induced stars in a graph
- Packing almost stars into the complete graph
- Title not available (Why is that?)
- On the completeness of a generalized matching problem
- Packing of graphs - a survey
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- An extension of Tutte's 1-factor theorem
- Packing lines in a hypercube
Cited In (8)
- 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
- Honeycomb arrays
- Domination in certain chemical graphs
- Spectrum of a dilated honeycomb network
- Title not available (Why is that?)
- Domination parameters in coronene torus network
This page was built for publication: Packing in honeycomb networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714696)
