Sciweavers

DM
2008
100views more  DM 2008»
14 years 19 days ago
Constructing and classifying neighborhood anti-Sperner graphs
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
John P. McSorley