Abstract
A book-embedding of a graph G comprises embedding the graphs nodes along the spine of a book and embedding the edges on the pages so that there is no crossing of arcs on each page. In this paper, we propose schemes to embed the connected double-loop networks with even cardinality in books.
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 callSimilar Papers
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.
