50 search results - page 2 / 10 » Note on Upper Bounds for TSP Domination Number |
114
Voted
DM
2007
15 years 1 months ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
137
Voted
EJC
2006
15 years 1 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
93
Voted
ARSCOM
2008
15 years 1 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
123
Voted
EUROCRYPT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
113
Voted
IJNSEC
2010
14 years 8 months ago
2010
Lagged Fibonacci Generators (LFG) are used as a building block of key-streamgenerator in stream cipher cryptography. In this note we have used the self-shrinkingconcept in LFG and ...