Sciweavers

125 search results - page 16 / 25
» ams 2000
Sort
View
EJC
2008
15 years 1 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
JNS
2007
68views more  JNS 2007»
15 years 1 months ago
Single Droplet Pattern in the Cylindrical Phase of Diblock Copolymer Morphology
The Ohta-Kawasaki density functional theory of diblock copolymers gives rise to a nonlocal free boundary problem. Under a proper condition between the block composition fraction a...
X. Ren, J. Wei
ICRE
2000
IEEE
15 years 5 months ago
Requirements Documentation: Why a Formal Basis is Essential
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
David Lorge Parnas
SIAMCO
2011
14 years 8 months ago
Internal Stabilization by Noise of the Navier--Stokes Equation
One shows that the Navier-Stokes equation in O⊂Rd, d = 2, 3, around an unstable equilibrium solution is exponentially stabilizable in probability by an internal noise controller...
Viorel Barbu, Giuseppe Da Prato
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 1 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid