On diagonal equations over finite fields via walks in NEPS of graphs
From MaRDI portal
(Redirected from Publication:1979953)
Abstract: In this paper, we obtain an explicit combinatorial formula for the number of solutions to the diagonal equation over the finite field , with and by using the number of -walks in NEPS of complete graphs.
Recommendations
Cites work
- Eigenspaces of graphs
- GCD-graphs and NEPS of complete graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 691493 (Why is no real title available?)
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- Numbers of solutions of equations in finite fields
- On a class of diagonal equations over finite fields
- On diagonal equations over finite fields
- On generalised Paley graphs and their automorphism groups
- On the number of solutions of diagonal equations over a finite field
- On the number of solutions to certain diagonal equations over finite fields
- Spectra of graphs
- The number of solutions of certain diagonal equations over finite fields
- The Waring's problem over finite fields through generalized Paley graphs
Cited in
(5)- A reduction formula for Waring numbers through generalized Paley graphs
- Waring numbers over finite commutative local rings
- Generalized Paley graphs equienergetic with their complements
- A note on almost cospectrality of components of NEPS of bipartite graphs
- Number of cliques of Paley-type graphs over finite commutative local rings
This page was built for publication: On diagonal equations over finite fields via walks in NEPS of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979953)