✦ LIBER ✦

On Parameters of Some Graphs from Finite Fields

✍ Scribed by I.E. Shparlinski

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 79 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1061

No coin nor oath required. For personal study only.

✦ Synopsis

We generalize the construction of F. R. Chung of graphs from finite fields and estimate their parameters with the help of a new bound of exponential sums due to G. I. Perel'muter and the author.

📜 SIMILAR VOLUMES

Some new perfect one-factorizations from

Some new perfect one-factorizations from starters in finite fields

✍ J. H. Dinitz; D. R. Stinson 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB

On vertex partitions and some minor-mono

On vertex partitions and some minor-monotone graph parameters

✍ D. Gonçalves 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

We study vertex partitions of graphs according to some minormonotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters are such that, any graph G with (G) ≥ 2 admits a vertex partition into two graphs with parameter at most (G)-1.

Some Systems of Diagonal Equations over

Some Systems of Diagonal Equations over Finite Fields

✍ Jacques Wolfmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

By using results of coding theory, we give results on the number of solutions of some systems of diagonal equations over finite fields.

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a

Constructions of bipartite graphs from f

Constructions of bipartite graphs from finite geometries

✍ Keith E. Mellinger; Dhruv Mubayi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

## Abstract We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These __n__ × __n__ bipartite graphs provide constructions of __C__~6~‐free graphs with Ω(__n__^4/3^ edges

Some remarks on the Picard curves over a

Some remarks on the Picard curves over a finite field

✍ Yoh Takizawa 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract In this paper we study the Newton polygon of the __L__ ‐polynomial __L__ (__t__) associate to the Picard curves __y__^3^ = __x__^4^ – 1, __y__^3^ = __x__^4^ – __x__ defined over a finite field 𝔽~__p__~ . In the former case we get a complete classification. In the latter case we obtai