Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf
Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf
... appear.
[2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier,
1997.
[3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes
for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degree
zero.
Since, by symmetry, one element in C
2
produces two vertices with degree zero or
New Bounds for Codes Identifying
Vertices...
Báo cáo toán học: " New Bounds for Union-free Families of Sets" potx
... of ordinary symbols in that position of R.(IfRis
always ∗ in that position the reply can be a
1
always.) Replying in this way
conveys no information about R when the symbol is ∗. So the information
about ... satisfied. Further calculations show ψ(p) is increasing
for p ≤ .3014−. Therefore the maximum of the combined bounds occurs at
p = .3014− at which point α = .4998− = .5φ(p), s =...
Báo cáo toán học: "General bounds for identifying codes in some infinite regular graphs" docx
... New bounds for codes identifying
vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999.
[7] G. Cohen, I. Honkala, A. Lobstein, G. Z´emor: Bounds for codes identifying vertices
in ... Lobstein: The minimum density of an identifying
code in the king lattice, Discrete Mathematics, submitted.
[4] I. Charon, O. Hudry, A. Lobstein: Identifying...
Báo cáo toán học: "Lower Bounds for q-ary Codes with Large Covering Radius" ppsx
... determine the winning tuples for the ga me G(n, M, q, k)
with decreasing d by starting with d = n; if (0, . . . , 0; 0) turns out to be a winning tuple,
then player T has a winning strategy for ... that
(3, 0; 1) is a winning tuple for the game G(7, 50, 9, 3; 0), that (4, 0; 1) is a winning tuple for
G(7, 50, 9, 3 ; 4) and that (5, 0; 1 ) is a winning tuple for G(7, 50, 9, 3; 5). Si...
Báo cáo toán học: "Lower bounds for identifying codes in some infinite grids" potx
... none of those three vertices
can witness a pair.
the electronic journal of combinatorics 17 (2010), #R122 7
Lower bounds for identifying codes
in some in nite grids
Ryan Martin
∗
Brendon Stanton
Department ... I
r
(v) the
identifying set of v.
Vertex identifying codes were introduced in [6] as a way to help with fault diagnosis
in multiprocessor computer syst ems. Code...
Báo cáo toán học: " Sharp bounds for Seiffert mean in terms of root mean square" pot
... below).
For information about publishing your research in Journal of Inequalities and Applications go to
http://www.journalofinequalitiesandapplications.com/authors/instructions/
For information ... 1)
2
> 0 (2.28)
for t > 1.
Equations (2.7)–(2.10) and inequality (2.28) lead to the conclusion that
f(t) is strictly increasing in [1, +∞).
9
Sharp bounds for Seiffert mean in...
Báo cáo toán học: "Asymptotic Bounds for Bipartite Ramsey Numbers" pot
... positive integer
r such that
every (red, green) coloring of the edges of
K
r,r
contains either a red K
m,m
or a green
K
n,n
. We obtain asymptotic bounds for
b
(m, n
) for
m ≥
2 fixed and n → ∞.
1 Introduction
Recent ... exact results for bipartite Ramsey numbers [4] have rekindled interest in this
subject. The bipartite Ramsey number b
(
m, n) is the smallest integer
r such that eve...
Báo cáo toán học: "Improved bounds for the number of forests and acyclic orientations in the square lattice" doc
... the
survey paper [3] for background information. In particular:
• T(G;2, 1) is the number f(G) of spanning forests in G;
• T(G;2, 0) is the number α(G) of acyclic orientations in G.
In the last section ... contain the edge joining vertices
(1, 1) and (2, 1). We denote by Λ
k
the corresponding matrix for this case. Then the
analogue to Theorem 3.2 is the following.
Theorem 6.3....
Báo cáo toán học: "Lower bounds for the football pool problem for 7 and 8 matches" pdf
... technique of the author for dealing with systems of linear
inequalities satisfied by the number of elements of a covering code, that lie in k-
dimensional subspaces of F
n
3
.
1 Introduction
Let F
3
= ... code with covering radius (at most) one, if
∀λ ∈ F
n
3
∃µ ∈ C with d(λ, µ) ≤ 1 (1)
holds. For a monograph on covering codes see [1]. The problem to determine k
3
(n), the
minimal card...
Báo cáo toán học: "Lower Bounds for the Size of Random Maximal H-Free Graphs" pdf
... cn
−(v
H
−2)/(e
H
−1)
for every g ∈ G
1
. For j ≥ 2,
G
j
is included in G
j
if and only if G
i
is included in G
i
for every i < j and in addition,
β(g) < β(g
j−1
) for every g ∈ G
j
. Now, ... Using this, Spencer
†
In this informal discussion, we cannot hope that T would be good, since for example, f appears as
an edge in some G
∈ Λ(g, ρ) for some g ∈ G ∈ Λ(f, ρ)...
Từ khóa: