Sciweavers

CORR
2012
Springer
194views Education» more  CORR 2012»
12 years 7 months ago
A Graph Theoretical Approach to Network Encoding Complexity
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Li Xu, Weiping Shang, Guangyue Han
CMA
2011
13 years 3 months ago
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is prove...
Aline Castro, Sandi Klavzar, Michel Mollard, Yoomi...
ENDM
2008
81views more  ENDM 2008»
13 years 12 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...