Diameter lower bounds for Waring graphs and multiloop networks

DOI10.1016/0012-365X(93)90160-UMaRDI QIDQ686473zbMATH OpenFDO

Authors Christine Garcia, Patrick Solé

Publication date 21 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower boundcirculant graphsGalois fieldmultiloop networksWaring graphWaring number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Recommendations

• The Waring's problem over finite fields through generalized Paley graphs
• A reduction formula for Waring numbers through generalized Paley graphs
• Waring numbers for diagonal congruences
• Waring's number mod \(m\)
• Waring's Number in a Finite Field

Cites work

• scientific article; zbMATH DE number 4004216 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A note on Waring's problem in GF (p)
• ON WARING'S PROBLEM FOR FINITE FIELDS

Cited in

(6)

• scientific article; zbMATH DE number 205764 (Why is no real title available?)
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• Waring numbers over finite commutative local rings
• A reduction formula for Waring numbers through generalized Paley graphs
• A survey on undirected circulant graphs
• The Waring's problem over finite fields through generalized Paley graphs

This page was built for publication: Diameter lower bounds for Waring graphs and multiloop networks

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