Abstract
AbstractIn this paper, we present an upper bound on the pagenumber of an iterated line digraph Lk(G) of a digraph G. Our bound depends only on the digraph G and is independent of the number of iterations k. In particular, it is proved that the pagenumber of Lk(G) does not increase with the number of iterations k. This result generalizes previous results on book‐embeddings of some particular families of iterated line digraphs such as de Bruijn digraphs, Kautz digraphs, and butterfly networks. Also, we apply our result to wrapped butterfly networks. © 2002 Wiley Periodicals, Inc.
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 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.
