Empirical Study of Graph Properties with Particular Interest Towards Random Graphs

TRICERATOPS

TriCollege Digital Repository

Empirical Study of Graph Properties with Particular Interest Towards Random Graphs

View Dublin Core Metadata

Title: Empirical Study of Graph Properties with Particular Interest Towards Random Graphs
Author: Weinstein, Lee
Advisor: Lindell, Steven
Department: Haverford College. Dept. of Computer Science
Type: Thesis (B.S.)
Running Time: 925462 bytes
Issue Date: 2005
Abstract: This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, radius, the eccentricity distribution, and the degree of the graph. The goal is to see if random graphs models are ideal for networks which seek to minimize network traffic and still keep the distance between nodes small.
Subject: Graph theory
Subject: Random graphs
Subject: Computer network architectures
Terms of Use: http://creativecommons.org/licenses/by-nc/3.0/us/
Permanent URL: http://hdl.handle.net/10066/1485

Files in this item

Files Description Size Format
2005WeinsteinL.pdf Thesis 903.7Kb PDF
2009WeinsteinL_release.pdf **Archive Staff Only** 79.17Kb PDF

Citation

Weinstein, Lee. "Empirical Study of Graph Properties with Particular Interest Towards Random Graphs". 2005. Available electronically from http://hdl.handle.net/10066/1485.

This item appears in the following Collection(s)

View Dublin Core Metadata

http://creativecommons.org/licenses/by-nc/3.0/us/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc/3.0/us/