115,928 research outputs found
Marianne Fangting Chen, violin and Yu Jin, piano, February 4, 2017
This is the concert program of the Marianne Fangting Chen, violin and Yu Jin, piano performance on Saturday, February 4, 2017 at 4:00 p.m., at the Concert Hall, 855 Commonwealth Avenue. Works performee were Sonata for Violin and Piano in A major, OP. 162, D. 574 by Franz Schubert, Violin concerto NO. 2 in G minor, Op. 63 by Sergei Prokofiev, and 3 Preludes for Violin and Piano by George Gershwin, arranged by Jascha Heifetz. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Let be a graph and be a subset of . A vertex-coloring
-edge-weighting of is an assignment of weight by the
elements of to each edge of so that adjacent vertices have
different sums of incident edges weights.
It was proved that every 3-connected bipartite graph admits a vertex-coloring
-edge-weighting (Lu, Yu and Zhang, (2011) \cite{LYZ}). In this paper,
we show that the following result: if a 3-edge-connected bipartite graph
with minimum degree contains a vertex such that
and is connected, then admits a vertex-coloring
-edge-weighting for . In
particular, we show that every 2-connected and 3-edge-connected bipartite graph
admits a vertex-coloring -edge-weighting for . The bound is sharp, since there exists a family of
infinite bipartite graphs which are 2-connected and do not admit
vertex-coloring -edge-weightings or vertex-coloring
-edge-weightings.Comment: In this paper, we show that every 2-connected and 3-edge-connected
bipartite graph admits a vertex-coloring S-edge-weighting for S\in
{{0,1},{1,2}
Vertex coloring of plane graphs with nonrepetitive boundary paths
A sequence is a repetition. A sequence
is nonrepetitive, if no subsequence of consecutive terms of form a
repetition. Let be a vertex colored graph. A path of is nonrepetitive,
if the sequence of colors on its vertices is nonrepetitive. If is a plane
graph, then a facial nonrepetitive vertex coloring of is a vertex coloring
such that any facial path is nonrepetitive. Let denote the minimum
number of colors of a facial nonrepetitive vertex coloring of . Jendro\vl
and Harant posed a conjecture that can be bounded from above by a
constant. We prove that for any plane graph
On the nature and order of the deconfining transition in QCD
The determination of the parameters of the deconfining transition in N_f=2
QCD is discussed, and its relevance to the understanding of the mechanism of
color confinement.Comment: 10 pages. In honour of Yu. A. Simonov on his seventyth birthday; to
be published in Yadernaya Fizik
Erratum: First-principles study on the intrinsic stability of the magic Fe13O8 Cluster [Phys. Rev. B 61, 5781 (2000)]
See Also: Original Article: Q. Sun, Q. Wang, K. Parlinski, J. Z. Yu, Y. Hashi, X. G. Gong, and Y. Kawazoe, First-principles studies on the intrinsic stability of the magic Fe13O8 cluster, Phys. Rev. B 61, 5781 (2000)
- …