Please use this identifier to cite or link to this item:
Title: A new direction in the study of the orientation number of a graph
Authors: NG KAH LOON
Keywords: graph, diameter, orientation number, optimal orientation
Issue Date: 3-Sep-2004
Citation: NG KAH LOON (2004-09-03). A new direction in the study of the orientation number of a graph. ScholarBank@NUS Repository.
Abstract: For a bridgeless graph G, let D(G) be the family of strong orientations of G, and define the orientation number of G to be d(G) = min{d(D) | D in D(G)}, where d(D) is the diameter of D. An orientation of G is said to be optimal if d(D) = d(G). Orientation numbers and corresponding optimal orientations of various classes of graphs have been studied extensively. In this thesis, we consider a family of graphs, denoted by G, obtained when a set of edges are added to link a family of disjoint graphs. For graphs G in G, we will look at their orientation numbers and design corresponding optimal orientations.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
NGKL.pdf1.4 MBAdobe PDF



Page view(s)

checked on Oct 21, 2018


checked on Oct 21, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.