shields-harary numbers of graphs with respect to continuous concave cost functionsshields-harary数量的图表对连续凹成本函数.pdf

IJMMS 2003:62, 3921–3930 PII. S0161171203212059 © Hindawi Publishing Corp. SHIELDS-HARARY NUMBERS OF GRAPHS WITH RESPECT TO CONTINUOUS CONCAVE COST FUNCTIONS JOHN HOLLIDAY and PETER JOHNSON Received 6 December 2002 The Shields-Harary numbers are a class of graph parameters that measure a certain kind of robustness of a graph, thought of as a network of fortified reservoirs, with reference to a given cost function. We prove a result about the Shields-Harary numbers with respect to concave continuous cost functions which will simplify the calculation of these numbers for certain classes of graphs, including graphs formed by two intersecting cliques, and complete multipartite graphs. 2000 Mathematics Subject Classification: 05C99, 90B99. 1. Introduction. Suppose we have finite simple graph G and a “weighting” function g : V (G) → [0, ∞), which together constitute a weighted network. Think of the weights assigned to each vertex of G by g as representing some amount of harmful “stuff” stored there. Some enemy of this weighted network might wish to dismantle it by knock- ing out vertices until the sum of weights on each remaining connected compo- nent is no greater than some threshold, say 1. (We will call a set of vertices which, after being knocked out, satisfies this requirement a g -dismantling set.) The enemy does not get to knock out vertices for free. The enemy will pay f (g(v)) to knock out vertex v where f is some particular nonincreas- ing, nonnegative function on the range of g . If S represents the set of vertices knocked out, then the enemy will pay v ∈S f (g(v)). Assume that the enemy’s intelligence is good and so the enemy will always pay the least amount to dis- mantle the networ