Sciweavers

36781 search results - page 265 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ENDM
2002
134views more  ENDM 2002»
15 years 5 months ago
Bounds on the signed domination number of a graph
Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighbor...
Ruth Haas, Thomas B. Wexler
JCT
2000
63views more  JCT 2000»
15 years 5 months ago
On the Number of Permutations Avoiding a Given Pattern
Noga Alon, Ehud Friedgut
JGAA
2000
53views more  JGAA 2000»
15 years 5 months ago
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees
Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok ...
MOC
2000
74views more  MOC 2000»
15 years 5 months ago
Higher-order Carmichael numbers
Everett W. Howe