An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, . . . , λ} to the nodes of the graph such that adjacent nodes are assigned integers of at least distance h ≥ 1 apart and all nodes of distance three or less must be assigned different labels. The aim...

A sequence {d <Subscript>1</Subscript>, d <Subscript>2</Subscript>, . . . , d <Subscript> n </Subscript>} of nonnegative integers is graphic (multigraphic) if there exists a simple graph (multigraph) with vertices v <Subscript>1</Subscript>, v <Subscript>2</Subscript>, . . . , v <Subscript> n </Subscript> such that the degree d(v <Subscript> i </Subscript>) of the vertex v <Subscript> i </Subscript> equals d <Subscript> i </Subscript> for each i = 1, 2, . . . , n. The (multi) graphic degree...</subscript></subscript></subscript></subscript></subscript></subscript></subscript></subscript></subscript>

We consider a dynamic mean-risk problem, where the risk constraint is given by the Average Value–at–Risk. As financial market we choose a discrete-time binomial model which allows for explicit solutions. Problems where the risk constraint on the final wealth is replaced by intermediate risk...

In this paper, the classical theory of two-person cooperative games is extended to two-person cooperative games with interval uncertainty. The core, balancedness, superadditivity and related topics are studied. Solutions called ψ <Superscript>α</Superscript>-values are introduced and characterizations are given....</superscript>

Relay nodes in an ad hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total transmission...

We study perturbations of a discrete-time Markov control process on a general state space. The amount of perturbation is measured by means of the Kantorovich distance. We assume that an average (per unit of time on the infinite horizon) optimal control policy can be found for the perturbed...

We present a discrete model of two-person constant-sum dynamic strategic market game. We show that for every value of discount factor the game with discounted rewards possesses a pure stationary strategy equilibrium. Optimal strategies have some useful properties, such as Lipschitz property and...

Models and algorithms for risk neutral and risk averse power optimization under uncertainty are presented. The approach differs from previous ones by incorporating the transmission network explicitly. Copyright Springer-Verlag 2009

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G....

Cost spanning tree problems concern the construction of a tree which provides a connection with the source for every node of the network. In this paper, we address cost sharing problems associated to these situations when the agents located at the nodes act in a non-cooperative way. A class of...