scientific article; zbMATH DE number 3880745

MaRDI QIDQ3346355zbMATH OpenFDO

Authors O. G. Rudenskaya, T. G. Malaksmano

Publication date 1984

zbMATH Keywords

diameter informationtransmission of information

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3891413
• scientific article; zbMATH DE number 3959292
• Changing and unchanging the diameter of a hypercube
• scientific article; zbMATH DE number 1263586
• scientific article; zbMATH DE number 3212735

Cited in

(6)

• Hyperedge channels are abelian
• Edge-wide-diameter of graphs with diameter d
• Network models with fixed parameters at the communication nodes. I
• An upper bound on the number of edges of a hypergraph with a given diameter
• Vertex and edge dimension of hypergraphs
• On the number of graphs and \(h\)-hypergraphs with bounded diameter

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 Q3346355)