Class of graphs with restricted neighborhoods

A description is obtained for connected graphs in which a point u is adjacent of v only if u is adjacent to all points whose degree is greater than that of v. The minimum number of lines in such a grpah with all points having degree at least d is also determined. Finally, an application to communication systems is discussed.