Name
Abstract | ||
|---|---|---|
In this paper, we present an upper bound on the pagenumber of an iterated line digraph L-k(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 L-k(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. (C) 2002 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/net.10032 | NETWORKS |
Keywords | Field | DocType |
book-embedding,pagenumber,iterated line digraphs,de Bruijn digraphs,Kautz digraphs,butterfly networks,wrapped butterfly networks | Discrete mathematics,Combinatorics,Embedding,Line graph,Upper and lower bounds,Book embedding,De Bruijn sequence,Butterfly network,Iterated function,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
40 | 2 | 0028-3045 |
Citations | PageRank | References |
7 | 0.59 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toru Hasunuma | 1 | 142 | 16.00 |