Báo cáo toán học: "Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3" pot

... to another. This means that we are forced to start with +3 and continue until we obtain the whole 0-class. After which we may either continue with 2, −3, . . . or with +2, −3, . . In the first case ... to describe the remaining class, using ±2. If we choose −1 then the smallest element in the next class is 2, and again we find it impossible to describe the remaining cl...

Ngày tải lên: 08/08/2014, 12:22

... attention (see e.g. “Graphs on the integers” in [10]). The most popular graph seems to be the coprime graph, altough there are many attractive problems and results concerning the divisor graph ([7], [8], ... denote the greatest common divisor and [a, b] the least common multiple of integers a, b. Consider the coprime graph on the integers. This is the graph whose...

Ngày tải lên: 07/08/2014, 06:22

... English as a lingua franca in teaching Chinese to speakers of other languages”) have been conducted on the teaching of Chinese to multilingual international students within China. In the context ... rigorous monolingual teaching method and the extremely challenging “language pledge” for speaking Chinese only. In the interview, T18 praised the “Princeton in Beijing” progra...

Ngày tải lên: 20/06/2014, 21:20

Ngày tải lên: 05/08/2014, 09:46

...

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... fixed points suffice, but r =2n requires at least three fixed points. Thus, the lack of further discontinuities in the graph of f(15,r) may, at first, seem counterintuitive. We discuss it in the next ... (5.2) because the j = α term is zero for k>1. Since each term of the sum in (5.1) is continuous, the only possible discontinuities are at the positive integers where the...

Ngày tải lên: 07/08/2014, 07:21

... standard paths must be increasing in every column, and have the additional property that whenever the numbers 1, 2, ,k occur as a contiguous sequence on the bottom row, then that sequence is k, k − 1, ... adding 1 to one of the parts of λ, or by inserting a part of size 1 into λ. We employ the methods they developed in order to study the same problem for the followin...

Ngày tải lên: 07/08/2014, 08:22

... + 1, the result above easily follows. This shows that the cycles C k with k ≥ 2r + 2 are the minimal graphs for the subgraph relationship in the class of 2-connected, r-twin-free graphs. But in ... vertices in graphs, IEEE Transactions on Information Theory, vol 44, pp. 599-6 11, 1998. [6] A. Lobstein, Bibliography on identifying and locating-dominating codes in graphs,...

Ngày tải lên: 07/08/2014, 15:22

... (3, 1, 2)), ( (2, 1), (2, 1, 3)), ( (2, 1), (3, 2, 1)), ( (2, 1), (1, 3, 2))}. • J 33 = {( (1, 3, 2), (1, 2, 3)), ( (2, 1, 3), (1, 2, 3)), ( (2, 1, 3), (1, 3, 2)), ( (2, 1, 3), (2, 1, 3)), ( (2, 1, 3), ... 3), (3, 2, 1)), ( (2, 3, 1), (1, 2, 3)), ( (2, 3, 1), (2, 3, 1)), ( (2, 3, 1), (3, 1, 2)), ((3, 1, 2), (1, 3, 2)), ((3, 1, 2), (2, 1, 3...

Ngày tải lên: 07/08/2014, 15:22