... reaction-centered
graphs of the type o f Graph 1 (these paths may contain
parallel and antiparallel arrows). The sign of that element
therefore depends on the both the sign and the magnitudes
of these influen ce paths ... the
kinetic parameters t hat enable such oscillations. The main
result of such an analysis is that oscillations arise if t he
parameter k
3
is the l a...
... the article as it appeared upon acceptance. Fully formatted
PDF and full text (HTML) versions will be made available soon.
Lyapunov-type inequalities for a class of even-order differential equations
Journal ... Yang, X, Kim, Y, Lo, K: Lyapunov-type inequalities for a class of quasilinear systems.
Math. Comput. Model. 53, 1162–1166 (2011)
[13] Zhang, Q, Tang, XH: Ly...
... spaces. Ibaraki and Taka-
hashi [10] introduced a new resolvent of a maximal monotone operator in Banach
spaces and the concept of the generalized nonexpansive mapping in Banach spaces.
Honda ... projection algorithms for finding a solution of an equilibrium problem with
a bifunction defined on the dual space of a Banach space, in this paper,...
... CAS E REP O R T Open Access
Visual diagnosis: Rectal foreign body: A primer for
emergency physicians
Bobby Desai
Abstract
We present a case that is occasionally seen within emergency departments, ... removal of the object for clinicians.
Case
A 39-year-old male presented to the Emergency Depart-
ment with vague complaints of abdominal pain and con-
stipation. He st...
... type of Shcherbina on the relation
between pluriporlarity of graphs and holomorphicity of complex-valued functions
defined on a domain in C
n
. In particular we establish the relation between the
... of graphs and holomorphicity of complex-valued functions. In particular,
we investigate the relation between the pluripolarity of graphs and th...
... on generalized convolu-
tion, for instance: the generalized convolution for integral transforms Stieltjes,
Hilbert and the cosine- sine transforms [12], the generalized convolution for H-
transform ... γ(y)=sign y for the Fourier, Fourier cosine
and sine transforms of functions f and g has a meaning and belongs to L(R)
and the factorization...
... δ). We establish these values in
Sections 2, 3 and 4.
TIGHT UPPER BOUNDS FOR THE DOMINATION NUMBERS
OF GRAPHS WITH GIVEN ORDER AND MINIMUM DEGREE
W. Edwin Clark
University of South Florida
Tampa, ... y.IfA⊆V then we let A denote the subgraph of G induced by A.
Table 1 contains the value of γ(n, δ) for n ≤ 16, 0 ≤ δ ≤ n − 1 if the value is
known, ot...
... referee for numerous comments and
suggestions which have led to a substantially improved paper.
An Asymptotic Expansion for the Number of
Permutations with a Certain Number of Inversions
Lane Clark
Department ... Eds., Handbook of Mathematical Functions with
Formulas, Graphs and Mathematical Tables, Dover Publications, New York, 1966.
[2] E .A. Bender, Central...
... graph of order n with
domination number at least 3 and minimum degree δ satisfying
n −2
√
n −4 ≤ δ ≤ n −
√
2
√
n.
Tight Upper Bounds for the Domination Numbers of
Graphs with Given Order and Minimum ... combinatorics 7 (2000), #R58 19
[2] W. Edwin Clark and Larry A. Dunning, Tight Upper Bounds for the Domination
Numbers of Graphs with...
... invalid in the other.)
This lemma, together with the discussion preceding it, completes the proof of formula
(18). We leave to the reader the task of showing that this formula reduces to formula
(4) ... t).
In other words, the statistics for labelled paths inside the triangle with vertices (0, 0), (0,n),
and (mn, n) give a combinatorial interpretation for the Hilber...
... a
basis for
< /b>
H
d−1
(R
d
A).
the electronic journal of < /b> combina torics 11(2) (2004), #R3 8
Geometrically < /b> constructed < /b> bases < /b> for < /b> homology < /b> of
< /b> partition < /b> lattices < /b> of < /b> types < /b> A, < /b> B and D
Anders Bjăorner
Royal ... theory of < /b> hyperplane arrangements to construct natural bases < /b> for
< /b> the...
... set. Vertices of R
G
ì D
H
are
the electronic journal of combinatorics 12 (2005), #N12 4
Vizing-like conjecture for the upper domination
of Cartesian products of graphs – the proof
Boˇstjan Breˇsar
∗
University ... prove the following conjecture of Nowakowski and Rall: For
arbitrary graphs G and H the upper domination number of the Carte...
... related to the automorphism groups of
trees have been investigated. We state, for instance, the enumeration of identity trees
(see [7]), and the question of determining the average size of the automorphism ... to G. Labelle for the summed cycle indices
of all rooted trees, which resembles the well-known formula for the cycle index of
the symme...
... decomposition, and where multi-edges are allowed. It is actually very easy to
adapt the grammar for the corresponding simple family of graphs. Call G the subfamily
of graphs in G that have no multiple ... subfamilies of G:
ã The class G
1
is the subfamily of graphs in G that are connected and have at least
one vertex.
ã The class G
2
is the subfamily of graphs in G that...
... T
n
be the class of tricyclic graphs on n vertices. In this paper, a sharp lower
bound for the total number of matchings of graphs in T
n
is determined.
1 Introduction
The total number of matchings ... index of hexagonal spiders.
In light of the information available for the total number of matchings of trees, unicyclic
graphs, bicyclic gr...