||The World Wide Web can be represented by a large directed graph
in which each vertex corresponds to a web page, and in which there
is an arc from one vertex to another if there is a hyperlink between
the corresponding web pages. It is infeasible to store and
manipulate the entire Web Graph, so we take a focused approach.
Beginning with a specified web page, we determine which other pages
are in close proximity to it, and then we construct the subgraph of
the Web Graph that is induced by these pages (i.e., we construct a
Neighbourhood Graph for the given initial vertex). We propose to
investigate some structural and statistical properties of these
Neighbourhood Graphs and to explore some strategies to extract web
communities in a local scale.