DM
2007
13 years 4 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
DM
2007
13 years 4 months ago
2007
DM
2007
13 years 4 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
DM
2007
13 years 4 months ago
2007
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
DM
2007
13 years 4 months ago
2007
The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
DM
2007
13 years 4 months ago
2007
In this paper, we obtain some new results R(5, 12) 848, R(5, 14) 1461, etc., and we obtain new upper bound formulas for Ramsey numbers with parameters. © 2006 Published by Elsevi...
DM
2007
13 years 4 months ago
2007
DM
2007
13 years 4 months ago
2007
We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
DM
2007
13 years 4 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...