Preprint Article Version 1 This version is not peer-reviewed

Bi-Symmetric Polyhedral Cages with Maximally Connected Faces and Small Holes

Version 1 : Received: 5 November 2024 / Approved: 6 November 2024 / Online: 7 November 2024 (07:18:58 CET)

How to cite: Piette, B.; Lukacs, A. Bi-Symmetric Polyhedral Cages with Maximally Connected Faces and Small Holes. Preprints 2024, 2024110400. https://doi.org/10.20944/preprints202411.0400.v1 Piette, B.; Lukacs, A. Bi-Symmetric Polyhedral Cages with Maximally Connected Faces and Small Holes. Preprints 2024, 2024110400. https://doi.org/10.20944/preprints202411.0400.v1

Abstract

Polyhedral cages (p-cages) describe the geometry of some families of artificial protein cages. We identify the p-cages made out of families of equivalent polygonal faces such that the faces of 1 family has 5 neighbours and P_1 edges, while those of the other family have 6 neighbours and P_2 edges. We restrict ourselves to polyhedral cages where the holes are adjacent to at most 4 faces. We characterise all the p-cages with a deformation of the faces, compared to regular polygons, not exceeding 10%.

Keywords

Uniform Polyhedra; Polyhedral Cages; Platonic Group; Near-miss Cages; Cayley graph; Protein Cage; Nano-cage; Capsid; Nanoparticle

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.