𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes

✍ Scribed by Li, Wei-Tian; Lu, Linyuan; Yang, Yiting

Book ID
118197110
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
208 KB
Volume
24
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

More rotation numbers for complete bipar
More rotation numbers for complete bipartite graphs
✍ BΓ©la BollobΓ‘s; E. J. Cockayne πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 285 KB

## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in