Diameter lower bounds for Waring graphs and multiloop networks

DOI10.1016/0012-365X(93)90160-UzbMath0784.05032MaRDI QIDQ686473

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

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

Related Items (5)

A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ The Waring's problem over finite fields through generalized Paley graphs ⋮ Waring numbers over finite commutative local rings ⋮ A reduction formula for Waring numbers through generalized Paley graphs ⋮ Unnamed Item

Cites Work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• A note on Waring's problem in GF (p)
• ON WARING'S PROBLEM FOR FINITE FIELDS
• Unnamed Item
• Unnamed Item

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