# Discrete Applied Mathematics

Discrete Applied Mathematics > 1997 > 74 > 3 > 295-299

^{2}+ ... + d

^{D}.Our result implies that known good solutions in the case d

^{+}= d

^{-}= d are also quasi-optimal under the assumption that d

^{+}...

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 163-174

Discrete Applied Mathematics > 1999 > 95 > 1-3 > 223-239

Discrete Applied Mathematics > 2000 > 98 > 3 > 191-207

^{k}of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we prove that every LexBFS-ordering of a distance-hereditary graph is both a common perfect elimination ordering of all even powers and a common semi-simplicial ordering of all powers of this graph. Moreover, we characterize...

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 3-12

Discrete Applied Mathematics > 2000 > 105 > 1-3 > 137-145

_{1}x

_{1}x

_{1}...x

_{1}x

_{1}(x

_{1}=1 or 0) such that for any other vertex t there exist at least two internally disjoint paths of length at most n-1 between x and t in UB(n), i.e., the (n-1,2)-dominating number of UB(n) is equal to one...

Discrete Applied Mathematics > 2001 > 113 > 1 > 73-85

Discrete Applied Mathematics > 2002 > 120 > 1-3 > 97-107

_{=n}(G) is the smallest number of vertices in any distance-n dominating set. If G is a graph of order p and each vertex in G has distance n to at least one vertex in G, then the distance-n...

Discrete Applied Mathematics > 2002 > 121 > 1-3 > 61-72

_{1},s

_{2}) with its diameter being the minimum among all double-loop networks with N stations. Since the diameter can be easily computed...

Discrete Applied Mathematics > 2003 > 132 > 1-3 > 79-84

_{i}(G) of a graph G at a distance i is the maximum number of independent vertices at distance i from any vertex. We study the impact of restricting α

_{i}(G) on the (global) independence number α(G). Among others, we show that in graphs with bounded diameter, α(G) is bounded if and only if α

_{i}(G) is bounded for at least one i, 2=<i=<(diam(G)-1)/4.

Discrete Applied Mathematics > 2004 > 136 > 2-3 > 349-362

Discrete Applied Mathematics > 2004 > 141 > 1-3 > 135-148

Discrete Applied Mathematics > 2006 > 154 > 11 > 1640-1644

Discrete Applied Mathematics > 2006 > 154 > 13 > 1885-1896

Discrete Applied Mathematics > 2006 > 154 > 14 > 2024-2031

Discrete Applied Mathematics > 2007 > 155 > 13 > 1752-1760

Discrete Applied Mathematics > 2008 > 156 > 7 > 986-997

Discrete Applied Mathematics > 2008 > 156 > 10 > 1670-1682

Discrete Applied Mathematics > 2008 > 156 > 15 > 2827-2834

Discrete Applied Mathematics > 2008 > 156 > 17 > 3194-3202