scientific article; zbMATH DE number 4043895

MaRDI QIDQ3781797zbMATH OpenFDO

Authors W. F. Smyth

Publication date 1987

zbMATH Keywords

design of communication networksdiameterMoore graphsRLSrooting level structureundirected graphs

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 4014755
• Graphs of order two less than the Moore bound
• Degree/diameter problem for trees and pseudotrees
• Moore graphs and beyond: a survey of the degree/diameter problem
• scientific article; zbMATH DE number 426169

Cited in

(7)

• Degree/diameter problem for trees and pseudotrees
• scientific article; zbMATH DE number 426169 (Why is no real title available?)
• An upper bound on the number of edges of a hypergraph with a given diameter
• The maximum valency of regular graphs with given order and odd girth
• scientific article; zbMATH DE number 870914 (Why is no real title available?)
• scientific article; zbMATH DE number 7471110 (Why is no real title available?)
• The maximum radius of graphs with given order and minimum degree

This page was built for publication:

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