1732 search results - page 79 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
180
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
150
click to vote
ACISP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
149
click to vote
JCT
2008
15 years 6 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
168
click to vote
CAIP
2007
Springer
16 years 17 days ago
2007
Springer
The paper focusses on a group of segmentation problems dealing with 3D data sets showing thin objects that appear disconnected in the data due to partial volume effects or a large...
176
click to vote
DM
1998
15 years 6 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...