- Title
- Graphs and subgraphs with bounded degree
- Creator
- Teska, Jakub
- Date
- 2008
- Type
- Text; Thesis; PhD
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/38757
- Identifier
- vital:1079
- Abstract
- "The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract.; Doctor of Philosophy
- Publisher
- Ballarat, Vic. : Author
- Rights
- Copyright Jakub Teska
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Hamiltonian systems; Computer networks; Data transmission systems; Australian Digital Thesis
- Full Text
- Hits: 1378
- Visitors: 1561
- Downloads: 357
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | DS1 | Australian Digital Thesis | 659 KB | Adobe Acrobat PDF | View Details Download |