Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The Connection Patterns of Two Complete Binary Trees

From MaRDI portal
Publication:3964589
Jump to:navigation, search

DOI10.1137/0601037zbMATH Open0499.05023OpenAlexW1994969664MaRDI QIDQ3964589FDOQ3964589


Authors: Fan Chung, Frank K. Hwang Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3964589&oldid=17672116"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 00:11. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki