The Klee and Quaife minimum (d, 1, 3)-graphs revisited

DOI10.1109/TCS.1980.1084800zbMath0429.05050OpenAlexW2094996634MaRDI QIDQ3866154

B. R. Myers

Publication date: 1980

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1980.1084800

zbMATH Keywords

diameterconnectivitymessagesassociated pseudographsbridge treecut-diameter graphminimum cubic graphsminimum graphsnonseparable minimum blockssurvivable communication networkswitching centers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication, information (94A99) Graph theory (05C99)

Related Items (3)

Regular separable graphs of minimum order with given diameter ⋮ Classification and enumeration of minimum (d, 3, 3)-graphs for odd d ⋮ Minimum graphs of specified diameter, connectivity and valence. II

This page was built for publication: The Klee and Quaife minimum (d, 1, 3)-graphs revisited