Báo cáo toán học: "Computing the Domination Number of Grid Graphs" potx
Báo cáo toán học: "Computing the Domination Number of Grid Graphs" potx
... V
. The domination number γ(G) of a graph
G is the cardinality of a smallest dominating set. When G is the m × n grid graph, we
denote the domination number by γ
m,n
= γ(G).
The domination number ... Chang, Domination Numbers of Grid Graphs, Ph.D. thesis, Dept. of Mathe-
matics, University of South Florida, 1992.
[3] T. Y. Chang and W. E. Clark, The...
Báo cáo toán học: "On the Domination Number of a Random Graph" docx
... from the first of these results that the domination number of G(n, p) is no larger
the electronic journal of combinatorics 8 (2001), #R37 1
≥ (log n)( n)p
2
ε
2
+ n =
(log n)(
n)p
2
4
+
n := C.
Thechoiceofε ... p)
r
+(1− p)
2r−s
n−2r+s
the electronic journal of combinatorics 8 (2001), #R37
7
On the Domination Number of a Random Graph
Ben Wieland
Department of Ma...
Báo cáo toán học: "On the crossing number of Km,n" potx
... defined in the same way as in the proof of Lemma 1.
Lemma 3 Let λ be the number of distinct pairs of elements of B having the same cyclic
ordering of edges incident on an element of A
. Then, if ... curve.
Definition 2 The crossing number cr
G
of a graph G is the smallest crossing number of
any drawing of G in the plane, where the crossing number cr
D...
Báo cáo toán học: " On the chromatic number of intersection graphs of convex sets in the plane" ppt
... circles in the plane with ω(G)=k
that is not (3k −4)-degenerate.
The idea of the proof of Theorem 1 allows us to estimate the maximum degree of the
intersection graph.
Theorem 2 Let G be the intersection ... translate of
Z. By Lemma 9, the intersection graph G of the family F
∗
(Z)={Z}∪{U
∗
| U ∈ F (Z)}
is a subgraph of H. In particular, the clique number of...
Báo cáo toán học: "On the chromatic number of simple triangle-free triple systems" pps
... chromatic number, although
we phrase it only for chromatic number.
In the next section we present the lower bound in Theorem 2 and the rest of the pa-
per is devoted to the proof of the upper bound. The ... simplicity is the same as
saying that the 3-graph is F -free, where F is the 3-graph of two edges sharing two vertices.
The proof of the lower bound in T...
Báo cáo toán học: "On the First Eigenvalue of Bipartite Graphs" ppt
... n
2
2. Then for e 5 the theorem follows
from Theorem 5.4 for r = 2 and Theorem 4.1. For e = 3 the theorem is trivial. For r 3
the theorem follows f r om Proposition 5.3, Theorem 5.4 and Theorem ... Introduction
The purpose of this paper is to study the maximum value of the maximum eigenvalue
of certain classes of bipartite graphs. These problems are analogous to the...
Báo cáo toán học: "On the uniform generation of modular diagrams" potx
... = |D
σ
m
(µ
m
= ∅)|
equals the number of weighted core of length m, i.e. the number of modular diag r ams
of length n. Suppose now we only consider sampling paths of weighed cores generated
via ... and replace
the insertion of step j(i) + 1 and the extraction at step (i − 1) by respective ∅-steps,
and thereby obtain the ∗-tableau f(ϑ). We then remove the two ∅-step...
Báo cáo toán học: "Computing the period of an Ehrhart quasi-polynomial" ppt
... least common multiple of
the denominators of all of the coordinates of the vertices of P . Assume that we can find
the prime factorization of D using an oracle. Initialize the following loop with ... [GC50]), where N is defined in terms of the
lengths of λ and µ.
Then #(P ∩ Z
N
) is the dimension of the weight µ subspace of the irreducible repre-
sentation...
Báo cáo toán học: "On the determining number and the metric dimension of graphs" pot
... C
n−1
is a minimum determining set of W
1,n−1
. Thus, the determining number of the
wheel graphs is always 2 independently of the number of vertices.
On the other hand, Shanmukha and Soor yanarayana ... (GH). The projection of S onto G is the set of vertices
u ∈ V (G) for which there exists a vertex (u, v) ∈ S. The projection of S onto H is
defined analogously....
Tài liệu Báo cáo khoa học: "Selecting the “Right” Number of Senses Based on Clustering Criterion Functions" pdf
... all values of
k from 1 N , and then determines the mean and
standard deviation of the criterion function. Then,
a score is computed for each value of k by sub-
tracting the mean from the criterion ... single threshold. The graph of the
P K1 scores shown in Figure 1 illustrates the dif-
ficulty - the slope of these scores is nearly linear,
and as such the threshold (...
Từ khóa: