Sciweavers

3204 search results - page 88 / 641
» The Alcuin Number of a Graph
Sort
View
IM
2007
13 years 8 months ago
Real Number Labelings for Paths and Cycles
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
Jerrold R. Griggs, Xiaohua Teresa Jin
FSTTCS
2000
Springer
13 years 11 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
COMBINATORICS
2006
132views more  COMBINATORICS 2006»
13 years 8 months ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 8 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 6 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...