Embedding iterated line digraphs in books
Copyright policy )Embedding iterated line digraphs in books
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.
block-embeddings, Kautz digraphs, pagenumber, Directed graphs (digraphs), tournaments, wrapped butterfly networks, de Bruijn digraphs, Planar graphs; geometric and topological aspects of graph theory
block-embeddings, Kautz digraphs, pagenumber, Directed graphs (digraphs), tournaments, wrapped butterfly networks, de Bruijn digraphs, Planar graphs; geometric and topological aspects of graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!