Báo cáo toán học: "Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces" pot
Báo cáo toán học: "Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces" pot
... graphs. We then give applications to random regular graphs
of high degree and to the Platonic graphs. We use the latter r esults to study the Cheeger
constants of arithmetic Riemann surfaces.
Our ... Isoperimetric Numbers of Regular Graphs
of High Degree with Applications
to Arithmetic Riemann Surfaces
Dominic Lanphier
∗
Department of Mathem...
Báo cáo toán học: "Maximum matchings in regular graphs of high girth" ppt
... #N1 4
Maximum matchings in regular graphs of high girth
Abraham D. Flaxman
Microsoft Research
Redmond, Washington, USA
abie@microsoft.com
Shlomo Hoory
IBM Research Laboratory
Haifa, Israel
shlomoh@il.ibm.com
Submitted: ... that for d -regular graphs with fixed d ≥ 3, the fraction of unmatched
vertices in a maximum matching is exponentially small in the girth of the graph. For...
Báo cáo toán học: "Perfect matchings in -regular graphs" potx
... addi-
tional ideas in [7] to derive a new proof of the Blow-Up Lemma of Koml´os, S´ark¨ozy
and Szemer´edi.
The upper bound in Theorem 1 is true for all bipartite graphs with maximum
degree at most (d ... factorials.
It is worth noting that since every -regular graph with density d and 2n vertices
contains, in each color class, at most n vertices of degree higher than (d...
Báo cáo toán học: "On certain integral Schreier graphs of the symmetric group" doc
... zero or an eigenvector of Y
n
with eigenvalue m − 1
(ii) x|
B
is either zero or an eigenvector of Y
n
with eigenvalue m − 1
(iii) x|
C
is either zero or an eigenvector of X
n
with eigenvalue m ... and to the right of p − 1.
By symmetry it suffices to show that any component of Az in any of these regions vanishes.
We do this by breaking the sum (Az)
ij
into three parts, cor...
Báo cáo toán học: "On k-Walk-Regular Graphs" potx
... journal of combinatorics 16 (2009), #R47 9
P roof. Assume first that (a) holds: if G is walk -regular, then the diagonal vector of A
ℓ
is diag(A
ℓ
) = a
(ℓ)
j, with j being the all-1 vector. Taking ... distance d. Fo r a given ordering of the vertices of G, the vector space of linear
combinations (with real coefficients) of the vertices is identified with R
n
, with canonical
b...
Báo cáo toán hoc:" Locally primitive normal Cayley graphs of metacyclic groups" potx
... is a factor group of C
+
. Further, as M is
regular on ∆
1
, C
+
6 M
∼
=
D
m
is semiregular on ∆
1
. Note that D
Γ (α)
α
is a factor gro up of
C
+
/Z( M), and subgroups and factor groups of a dihedral ... journal of combinatorics 16 (2009), #R96 10
By Lemma 4.5, to prove Theorem 1.3, it is sufficient to prove that every connected
locally primitive normal Cayley graph of metacycl...
Báo cáo toán hoc:"Tetravalent non-normal Cayley graphs of order 4p" ppsx
... Cayley graphs. For this reason, it suffices to consider the connected ones when
one investigates the normality of Cayley graphs. One of the standard problems in the
studying of normality of Cayley graphs ... is to determine the normality of Cayley graphs
with specific orders. It is well- known that every transitive permutation gr oup of prime
degree p is either 2-transi...
Báo cáo toán học: "uantum Walks on Regular Graphs and Eigenvalues" ppt
... procedure of Douglas and Wang in [1] has also been t ested on
classes of strongly regular graphs and of regular g raphs, where all non-isomorphic graphs
were distinguished.
Finding a pair of non-isomorphic ... S
+
(U) for a regular graph G. If G is
regular with valency 1, then G must be a matching and the spectrum of S
+
(U(G)) is
easily determined. We may direct o ur...
Báo cáo hóa học: " Research Article Estimation on Certain Nonlinear Discrete Inequality and Applications to Boundary Value Problem" pot
... are a lot of
papers investigating t hem such as 3–8. Along with the development of the theory of
integral inequalities and the theory of difference equations, more attentions are paid to some
discrete ... Research Foundation of the Education Department
Guangxi Province of China 200707MS112 and by Foundation of Natural Science and Key
Discipline of Applied Mathematics...
Báo cáo toán học: "Stapled Sequences and Stapling Coverings of Natural Numbers" doc
... equivalent to the sequence [2184+30030k, 2200+
30030k], k ∈ , with respect to the same set of congruences, where 30030 is
the least common multiple of 2,3,5,7,11,13.
The same set of first indicators ... that allows us to transform
astaplingcoveringofagivenexpenseintoastaplingcoveringwiththe
cutoff u(T )=f(ε)?
2. Do there exist constructions for efficient stapling coverings of any...