Cubic and quadruple Paley graphs with the n-e.c. property

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...

Full description

Bibliographic Details
Main Authors: Ananchuen, Watcharaphong, Caccetta, Louis
Format: Journal Article
Published: Elsevier Science BV 2006
Online Access:http://www.elsevier.com/wps/find/journaldescription.cws_home/505610/description#description
http://hdl.handle.net/20.500.11937/17637