Skip navigation
Skip navigation

Distance domination and amplifier placement problems

Taylor, S; Wanless, Ian; Boland, N L

Description

We consider the optimisation problem defined on a connected undirected graph with given root vertex and a parameter s, in which we seek a spanning tree with the smallest number of special (amplifying) vertices such that each vertex in the tree is preceded

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
URI: http://hdl.handle.net/1885/32035
Source: Australasian Journal of Combinatorics

Download

File Description SizeFormat Image
01_Taylor_Distance_domination_and_2006.pdf1.5 MBAdobe PDF    Request a copy


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

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator