Báo cáo toán học: "Distance domination and distance irredundance in graphs" ppsx
Báo cáo toán học: "Total domination and matching numbers in claw-free graphs" doc
... with minimum degree at
least three that have equal total domination and matching numbers.
Keywords: claw-free, matching number, total domination number
1 Introduction
Total domination in graphs ... R. M. Dawes, and S. T. Hedetniemi, Total domination in graphs.
Networks 10 (1980), 211–219.
[4] O. Favaron and M. A. Henning, Paired domination in claw-free cubic graphs. Grap...
Báo cáo toán học: " Tight Quotients and Double Quotients in the Bruhat Order" doc
... other hand, bearing in mind that µ and ν are in the interior of the same Weyl
chamber C,andwµ = µ
+
and wν = ν
+
are dominant, we may use Proposition 4.4 to
compare the ranks of x(µ)andx(ν) in the ... , including the cross section X and the subspace V .Moreover,V also
carries a standard ordering relative to the root system Φ; however, these two “standard”
orderings of V coincide:...
Báo cáo toán học: "Topological circles and Euler tours in locally finite graphs" pptx
... Diestel and D. K¨uhn. On in nite cycles II. Combinatorica , 24:91–116, 2004.
[15] R. Diestel and D. K¨uhn. Topological paths, cycles and spanning trees in infinite
graphs. Europ. J. Combinatorics, ... ny arc in |G| with on e endpoint in X and one in Y contains an edge from F .
4 Euler tours
In this section we prove Theorem 1.3, but before we do so let us consider an example...
Báo cáo toán học: "Derangement Polynomials and Excedances of Type B" ppsx
... Combinatorics and Gra ph Theory 95,
Vol. 1 (Hefei), World Sci. Publishing, River Edge, NJ, 199 5, pp. 462–465,
[18] X.D. Zhang, On a kind of sequence of polynomials, in: Computing and Combina-
torics, ... [1], and
it enables us to derive the generating function of d
B
n
(q). Then we give a combinatorial
interpretation of the generating function formula by extending the type A argument...
Báo cáo toán học: "Rationality, irrationality, and Wilf equivalence in generalized factor order" ppsx
... of the embedding
factor w
′
= 343 which has embedding index 5, and the two 2’s of u are in po sitions 6 and
7. Note that we obtain ordinary factor order by taking P to be an antichain. Also, we
will ... “weakly increasing”
and “maximum” have their usual meanings. Also, let w
+m
be the result of applying the
+ operator m times. By using the previous lemma a nd induction, we obtain the...
Báo cáo toán học: "Bootstrap Percolation and Diffusion in Random Graphs with Given Vertex Degree" pptx
... Lelarge. Diffusion of innovations on random networks: Understanding the chasm.
In Proceedings of WINE 2 008, pages 178–185, 2008.
[20] M. Molloy and B. Reed. A critical point for random graphs with ... decreasing when θ = d − 1 and has only one
minimum point when θ < d − 1 (see [4] f or details). Thus for θ < d − 1, the only local
minimum point is the global minimum point ˆy with P...
Báo cáo toán học: "Dry matter and nitrogen allocation in western redcedar, western hemlock, a" ppsx
...
relative
dry-matter
increment
(Log
e
(DM
final
) -
Log
e
(DM
initial
);
RDMI)
and
relative
N
increment
(Log
e
(N
final
) -
Log
e
(N
initial
);
RNI)
in
each
soil
and
accumulated
35 ...
Haverlandt
(Cavenham
Forest
Industries)
for
supplying
the
seedlings
and
Bud
Graham
for
planting
assistance.
Jane
Thomas
and
four
anony-
mous
referees
provided
valuable...
Báo cáo toán học: "Partitions, rooks, and symmetric functions in noncommuting variables" pdf
... in the lattice of par titio ns, so π
x
is obtained by merging
blocks of π. Equivalently, p
π
is the sum of all monomials where the indices in the jth
and kth places are equal if j and k are in ... boards by letting the unit rook correspond to the empty
partition. Consider the vector space QR of all formal linear combinations of rooks in R.
By both extending
ˆ
⊕ linearly and lett...
Báo cáo toán học: " How to find overfull subgraphs in graphs with large maximum degree, II" ppsx
... to determine all of them. Let p ≥ 2
be an integer. We obtain the graph G
1
p
from two disjoint complete graphs K
2p+1
and
K
2p
by removing an edge xy ∈ E(K
2p+1
) and joining x to u and y to ... determined in O(n + m) time, and the sorting is done in
O(n log n) time. Lemma 3.1 shows that only the vertex sets considered in the final phase
of the algorithm can induce ∆-overfull sub...