Abstract
A graph is extended periodic if it can be made up by gluing identical pieces together with a graph which is isomorphic to or subgraph of that piece, in a circular fashion. We consider an infinite sequence Hn of extended periodic 4-regular graphs and an infinite sequence Mn of extended periodic 5-regular graphs. A book is a collection of half-planes called pages, all having a common boundary called the spine. A book embedding of a graph G is to put the vertices of G on the spine and each edge of G is contained in one page. The minimum pages needed to embed a graph G into a book is called pagenumber of G. We determine the pagenumbers of Hn and Mn to be three.
Sign-in/Register to access full text options 
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
