Blocking Probabilities for a Class of Spiderweb Channel Graphs

DOI10.1109/TCOM.1980.1094579zbMath0422.94064OpenAlexW2051115431MaRDI QIDQ3856660

Frank K. Hwang

Publication date: 1980

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1980.1094579

zbMATH Keywords

blocking probabilities for spiderweb channel graphs

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Cycle Polynomials

This page was built for publication: Blocking Probabilities for a Class of Spiderweb Channel Graphs