Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
DOI10.1007/s10910-021-01234-6zbMath1476.92058OpenAlexW3154540552MaRDI QIDQ2038934
Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja
Publication date: 7 July 2021
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-021-01234-6
\(P_3\)-packingperfect \(P_3\)-packing\(C_4\)-packing\(HAC_5C_6C_7[n,m\)]\(HAC_5C_7[n,m\)]\(TUC_4C_8(R)\)\(TUC_4C_8(S)\)almost perfect \(P_3\)-packingarmchair carbon nanotube \(ACNT[n,m\)]Boron triangular carbon nanotubes \(BNT_t[n,m\)]induced \(P_3\)-packing \(k\)-partitionperfect \(C_4\)-packingzigzag carbon nanotube \(ZCNT[n,m\)]zigzag polyhex carbon nanotube \(TUHC_6[2m,n\)]
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On topological properties of the line graphs of subdivision graphs of certain nanostructures
- Packing lines in a hypercube
- Packing in honeycomb networks
- Some applications of graph theory to clustering
- Theory of maximum packing and related channel assignment strategies for cellular radio networks
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Some computational aspects of boron triangular nanotubes
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- HYPER-WIENER INDEX OF ZIGZAG POLYHEX NANOTUBES
This page was built for publication: Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures