The minimum-order three-connected cubic graphs with specified diameters

DOI10.1109/TCS.1980.1084880zbMATH Open0438.05036OpenAlexW2109240781MaRDI QIDQ3879262FDOQ3879262

Authors: 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.1084880

zbMATH Keywords

design of survivable communications networksminimum-order three-connected cubic graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Applications of graph theory to circuits and networks (94C15)

Cited In (6)

• Decomposition of 3-connected cubic graphs
• Regular separable graphs of minimum order with given diameter
• Minimum orders of Eulerian oriented digraphs with given diameter
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
• The maximum radius of graphs with given order and minimum degree

This page was built for publication: The minimum-order three-connected cubic graphs with specified diameters

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