- Title
- Degree diameter problem on triangular networks
- Creator
- Holub, Přemysl; Ryan, Joe
- Relation
- Australasian Journal of Combinatorics Vol. 63, Issue 3, p. 333-345
- Relation
- http://ajc.maths.uq.edu.au/?page=get_volumes&volume=63
- Publisher
- Centre for Discrete Mathematics & Computing, University of Queensland
- Resource Type
- journal article
- Date
- 2015
- Description
- The degree diameter problem involves finding the largest graph (in terms of number of vertices) subject to constraints on the degree and the diameter of the graph. Beyond the degree constraint there is no restriction on the number of edges (apart from keeping the graph simple) so the resulting graph may be thought of as being embedded in the complete graph. In a generalisation of this problem, the graph is considered to be embedded in some connected host graph. This article considers embedding the graph in the triangular grid and provides some exact values and some upper and lower bounds for the optimal graphs. Moreover, all the optimal graphs are 2-connected, without this constraints no larger graphs were found.
- Subject
- degree; diameter; triangular networks; graphs
- Identifier
- http://hdl.handle.net/1959.13/1316027
- Identifier
- uon:23057
- Identifier
- ISSN:1034-4942
- Language
- eng
- Full Text
- Reviewed
- Hits: 872
- Visitors: 1056
- Downloads: 232
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Publisher version (open access) | 889 KB | Adobe Acrobat PDF | View Details Download |