Distance domination and amplifier placement problems
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
|Collections||ANU Research Publications|
|Source:||Australasian Journal of Combinatorics|
|01_Taylor_Distance_domination_and_2006.pdf||1.5 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.