The Connection Patterns of Two Complete Binary Trees

DOI10.1137/0601037zbMATH Open0499.05023OpenAlexW1994969664MaRDI QIDQ3964589FDOQ3964589

Authors: Fan Chung, Frank K. Hwang 

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601037

zbMATH Keywords

channel graphscomplete binary treeconnection patterns

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Cited In (3)

• The blocking probability of spider-web networks
• The asymptotic optimality of spider-web networks
• Title not available (Why is that?)

This page was built for publication: The Connection Patterns of Two Complete Binary Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964589)