Graphs with prescribed adjacency properties

Graphs with prescribed adjacency properties

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. The class of graphs having property P(m.n,k) is denoted by ζ(m,n,k). The prob...

Full description

Bibliographic Details
Main Author: Ananchuen, Watcharaphong
Format: Thesis
Language:English
Published: Curtin University 1993
Subjects:
adjacency property
Paley graphs
Paley tournaments
Online Access:http://hdl.handle.net/20.500.11937/1570

Similar Items

Similar Items