Báo cáo toán học: "A prolific construction of strongly regular graphs with the n-e c property" pptx
Báo cáo toán học: "A prolific construction of strongly regular graphs with the n-e.c. property" pptx
... indicate that the choice of permutations adds more
randomness to our construction than the choice of bijections.
Construction 2 is the version of Construction 1 that produces the graphs in Theorem
1.1.
Construction ... which are adjacent
the electronic journal of combinatorics 9 (2002), #R31 7
A proli c construction of strongly regular graphs with
t...
Báo cáo toán học: "A Quasi-Spectral Characterization of Strongly Distance-Regular Graphs" ppsx
... distance d in Γ—is strongly regular. The only known examples of these graphs
are the strongly regular graphs (with diameter d = 2), the antipodal distance -regular
graphs, and the distance -regular graphs ... terms of the eigenvalues, the sum of the
multiplicities corresponding to the eigenvalues with (non-zero) even subindex,
and the harmonic mean...
Báo cáo toán học: " Neighbour-distinguishing edge colourings of random regular graphs" ppt
... lengths congruent to 2 (mod 3)).
Colour the edge vw with the colour γ, and colour the rest of H
2
with colours δ, , ζ to
give an nd-colouring of H
2
. Next, colour the edges of H
1
with colours ... two
crucial probabilistic claims used in that proof are deferred to Section 4.
the electronic journal of combinatorics 13 (2006), #R77 2
Let us see now how these two lemmas...
Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt
...
Background
The main objective of the current single crystalline silicon [c- Si] photovoltaic
research is to enhance the efficiency of the solar cell without a too complicated process. One
of ... that of the emitter with a 45-Ω/sq sheet resistance is 180,000 cm/s [1].
The quality of metal contact can also affect the solar cell efficiency. For commercial
c- Si...
Báo cáo toán học: "A Note on Maximal Nonhamiltonian Burkard–Hammer Graphs" pptx
... By Case 1, the graph H
t
+ wv has a
Hamilton cycle C which must contain the edge wv because H
t
is nonhamiltonian.
Let
−→
C be the cycle C with an orientation. By
←−
C we denote the cycle C with ... not in C because deg(u
∗
4
) = 3, contradicting our assumption that
C is a Hamilton cycle of L. Thus, this case cannot occur.
(ii) v
∗
1
u
∗
1
v
∗
2
is in C.
In this...
Báo cáo toán học: " A Stochastic EOQ Policy of Cold-Drink-For a Retailer" ppsx
... =τ
∗
+1
p(τ).
Similarly Eac(τ
∗
− 1) − Eac(τ
∗
) > 0 implies
(τ
∗
− 1) +
C
2
C
1
− C
2
μ + C
s
(τ
∗
− 1) <
C
s
C
1
− C
2
μ + C
s
.
Therefore for minimum value of Eac(τ
∗
), the following condition must ... satis-
fied
(τ
∗
)+
C
2
C
1
− C
2
μ + C
s
(τ
∗
)
>
C
s
C
1
− C
2
μ + C
s
> (τ
∗
− 1)+
C
2
C
1
− C
2
μ + C
s
(τ
∗
− 1) (4)
Case I...
Báo cáo toán học: " A Blowing-up Characterization of Pseudo Buchsbaum Modules" ppsx
... above the function J
M
(x(n)) is independent of the choic e of a system of
parameters x
.
The numerical invariant of M given in the above theorem is called the
polynomial type of fractions of M ... prove the second statement of Theorem 1.
ProofofStatement(ii) of Theorem 1. By the same argument in the proof of
Stament (i) of Theorem 1, we can assume without...
Báo cáo toán học: "A note on antichains of words" potx
... evidence to the contrary is provided by the example w = abcacb.
It seems likely that abcacb is 2-avoidable; there are words of length 1000 over {0, 1} avoiding
abcacb.However,abcacb and bcacba ... allowed the author to make these discoveries
concerning abcacb.
A note on antichains of words
James D. Currie
∗
Department of Mathematics and Statistics
University of Winnipeg
Winnipeg...
Báo cáo toán học: "A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16" pptx
... that the current status of the problem can
be obtained from Gordon Royle [2].
The General Construction
We describe a family of cubic graphs with girths in the stated range. We begin with a description
of ... cubic graphs with girths in the range 13 to 16 is described. The
method is used to construct the smallest known cubic graphs for girths 14, 15 and 16.
In...
Báo cáo toán học: "A Fibonacci-like sequence of composite numbers" ppt
... for the m
k
abovetobeabletocovertheintegersn c
1
(mod 64),
then they divided by their greatest common divisor with 64 must cover all of the
integers.
the electronic journal of combinatorics 6 ... column must cover the integers n ≡ f (mod 6). After dividing
the m
k
of the third column by their greatest common divisor with 6, it is clear
that none of the moduli of...