Diameter lower bounds for Waring graphs and multiloop networks

DOI10.1016/0012-365X(93)90160-UzbMATH Open0784.05032MaRDI QIDQ686473FDOQ686473

Authors: Christine Garcia, Patrick Solé 

Publication date: 21 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Title not available (Why is that?)
• A note on Waring's problem in GF (p)
• ON WARING'S PROBLEM FOR FINITE FIELDS

Cited In (6)

• Waring numbers over finite commutative local rings
• The Waring's problem over finite fields through generalized Paley graphs
• Title not available (Why is that?)
• A survey on undirected circulant graphs
• Title not available (Why is that?)
• A reduction formula for Waring numbers 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)