Báo cáo toán học: "Cayley Graphs of Abelian Groups Which Are Not Normal Edge-Transitive" pot
Báo cáo toán học: "Cayley Graphs of Abelian Groups Which Are Not Normal Edge-Transitive" pot
... Sim, The normality of Cayley graphs of finite
abelian groups with Valency
5, System Science and Mathematical Science 13
(2000) 420–431.
Cayley Graphs of Abelian Groups Which Are Not Normal Edge-Transitive ... which graphs in the
lists are edge-transitive and which graphs in the lists are normal edge-transitive.
The proof of Theorem 1.2 is in Secs. 3 an...
Báo cáo toán học: " New Graphs of Finite Mutation Type" docx
... which are of finite mutation type, but which are not of
geometric type or isomorphic to the 9 known exceptional cases. It is natural to ask
whether there are any more exceptional graphs of finite ... least 2 neighbors which are only connected to x.
the electronic journal of combinatorics 15 (2008), #R139 9
1.5 Graphs of extended affine types
The following graphs a...
Báo cáo toán học: "Cayley graphs on the symmetric group generated by initial reversals have unit spectral gap" potx
... decomposition
of th e Laplacian of Cayley graphs, into a direct sum of irreducible representation
matrices of the symmetric group.
1 Introduction
If G is a finite group, H is a subgroup of G and Z ... combination of transpositions with non-
negative coefficients. A weaker version of this statement, namely for bipartite graphs,
was also conjectured in [5]. Several papers have app...
Báo cáo toán học: " The Existence of Solutions to Generalized Bilevel Vector Optimization Problems" potx
... weakly efficient points of A is denoted by W Min (A/C).
We use α Min (A/C) to denote one of I Min (A/C),P Min (A/C), The
notions of I Max (A/C),P Max (A/C), PrMax (A/C), W Max (A/C)arede-
fined dually.
We ... corresponding to D
and F. The set of such points ¯x is denoted by αS(D, F; C) and is called the
solution set of (GV OP )
α
. The elements of α Min (F (D)/C) are called optimal...
Báo cáo toán học: "The solution of the Ar T-system for arbitrary boundary" potx
... α = 1 and α = 2, which form two square lattices, the vertices of the second
layer lying at the vertical of the centers of the faces of the first layer.
the electronic journal of combinatorics ... (resp. v → y) are precisely the two
types of forward mutations of the A
2
T-system cluster algebra, obtained by applying the
first (resp. second) line of (3.1). We may now turn to t...
Báo cáo toán học: "On variants of Conway and Conolly’s Meta-Fibonacci recursions" potx
... 1.
the electronic journal of combinatorics 18 (2011), #P96 6
know whether the consecutive increments condition is necessary or simply sufficient. The
authors are not aware of any examples where the ... also does not exists any n ≥ 3
such that ∆(n) = ∆(n − 1) = 1.
Proof. Suppose not for the sake of a contradiction. We consider three cases for how the
claim could fail to be true, ba...
Báo cáo khoa học: "Ultrasonographic measurement of optic nerve sheath diameter in normal dogs" pot
... of breed, sex, body weight and age on biometry
of ONSD
Correlations with body weight of each breed
Correlations of ONSD with body weight of each breed
were not significant. The correlations of ... RI
<RUNVKLUHWHUULHUDQG0DOWHVH,QGHSHQGHQW9WHVWS
7KHUHVXOWLVOLVWHGLQWKH7DEOH:KHQWKHPHDQYDOXHV
EHWZHHQWKHPDOHDQGIHPDOHZHUHFRPSDUHGVLJQLILFDQW
GLIIH...
Báo cáo toán học: "Some properties of unitary Cayley graphs" pdf
... every term of the sequence
S =
µ(t)
ϕ(n)
ϕ(t)
t∈M
ϕ(t)−times results in a sequence
˜
S of length m which consists of all nonzero eigen-
values of X
n
such that the number of appearences of an ... divisors.
The eigenvalues of a graph G are the eigenvalues of an arbitrary adjacency matrix of
G. In Section 4 we show that all nonzero eigenvalues of X
n
are divisors...
