Cubic and quadruple Paley graphs with the n-e.c. property
MetadataShow full item record
A graph G is n-existentially closed or n-e.c. if for any two disjoint subsets A and B of vertices of G with |A ∪ B| = n, there is a vertex u /∈A ∪ B that is adjacent to every vertex of A but not adjacent to any vertex of B. It is well-known that almost all graphs are n-e.c. However, few classes of n-e.c. graphs have been constructed. A good construction is the Paley graphs which are defined as follows. Let q ≡ 1(mod 4) be a prime power. The vertices of Paley graphs are the elements of the finite field Fq. Two vertices a and b are adjacent if and only if their difference is a quadratic residue. Previous results established that Paley graphs are n-e.c. for sufficiently large q. By using higher order residues on finite fields we can generate other classes of graphs which we called cubic and quadruple Paley graphs. We show that cubic Paley graphs are n-e.c. whenever q_n224n−2 and quadruple Paley graphs are n-e.c. whenever q_9n262n−2.We also investigate a similar adjacency property for quadruple Paley digraphs.
Showing items related by title, author, creator and subject.
Ananchuen, Watcharaphong (1993)A graph G is said to have property P(m,n,k) if for any set of m + n distinct vertices there are at least k other vertices, each of which is adjacent to the first m vertices but not adjacent to any of the latter n vertices. ...
Ananchuen, Nawarat (1994)Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is said to be k-extendable if for every matching M of size k in G there is a perfect matching in G containing all the edges ...
Chang, Elizabeth; Tan, H.; Dillon, Tharam S.; Feng, L.; Hadzic, Fedja (2005)An XML enabled framework for representation of association rules in databases was first presented in [Feng03]. In Frequent Structure Mining (FSM), there are techniques proposed to mine frequent patterns from complex trees ...