Existentially closed graphs via permutation polynomials over finite fields

DOI10.1016/j.dam.2016.05.017zbMath1346.05045OpenAlexW2487680673MaRDI QIDQ317417

Tran Dang Phuc, Nguyen Minh Hai, Le Anh Vinh

Publication date: 30 September 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.017

zbMATH Keywords

permutation polynomialdistance graphsexistentially closed graphs

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomials with small value set over finite fields
• Character sums over integers with restricted \(g\)-ary digits
• Polynomials with minimal value sets
• An explicit construction of \((3,t)\)-existentially closed graphs
• A note on polynomials with minimal value set over finite fields
• A construction of 3-e.c. graphs using quadrances
• Polynomials over finite fields with minimal value sets
• Quasi-Monte Carlo methods and pseudo-random numbers
• Asymmetric graphs

This page was built for publication: Existentially closed graphs via permutation polynomials over finite fields