Abstract
We enumerate spatial 2-bouquet graphs, or spatial graphs having exactly one 4-valent vertex and no other vertices, up to flat vertex isotopy. In order to do that, we give a method of constructing all such graphs from 2-string tangles, and distinguish the resulting graphs by computing their Yamada polynomials. We then prove that there exist exactly 51 flat vertex isotopy classes of the prime spatial 2-bouquet graphs with up to six crossings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
