Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/129944
Title: On optimal orientations of tree vertex-multiplications
Authors: Koh, K.M. 
Tay, E.G.
Issue Date: 2006
Source: Koh, K.M., Tay, E.G. (2006). On optimal orientations of tree vertex-multiplications. Australasian Journal of Combinatorics 34 : 69-87. ScholarBank@NUS Repository.
Abstract: For a bridgeless connected graph G, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) (resp., d(G)) the diameter of D (resp., G). Define d(G) = min{d(D)|D ∈ D(G)}. In this paper, we study the problem of evaluating d(T(s1, s2, ..., sn)), where T(s1,s2, ..., sn) is a T vertex-multiplication for any tree T of order n ≥4 and diameter at least 3, and any sequence (si) with si ≥ 2, i = 1,2, ..., n. We show that d{T(s1, s2, ..., sn)) ≤ d(T) + 1 with d{T(s1, s2, ..., sn)) = d(T) for most cases.
Source Title: Australasian Journal of Combinatorics
URI: http://scholarbank.nus.edu.sg/handle/10635/129944
ISSN: 10344942
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

7
checked on Feb 22, 2018

Google ScholarTM

Check


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