Báo cáo toán học: "Bounds for the H¨ckel energy of a graph u" pptx

Báo cáo toán học: "Bounds for the H¨ckel energy of a graph u" pptx

Báo cáo toán học: "Bounds for the H¨ckel energy of a graph u" pptx

... adjacency matrix o f G. Then the eigenvalues of G are defined as the eigenvalues of A. As all eigenvalues of A are real, we can rearra nge them as λ 1  ···  λ n . I. Gutman (see [9]) defined the energy ... eigenvalue. Then by [5, Theorem 6.7], G is a complete multipartite graph. As the r ank of a complete multipartite graph equals t he number of its parts, G must...
Ngày tải lên : 08/08/2014, 01:20
  • 12
  • 275
  • 0
Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx

Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx

... SIAM, Philadelphia, 1992. [11] E. Novak (Joint work with A. Hinrichs). New bounds for the star discrepancy.Ex- tended abstract of a talk at the Oberwolfach seminar “Discrepancy Theory and its Applications”, ... discrepancies and δ-covers.Ex- tended abstract of a talk at the Oberwolfach seminar “Discrepancy Theory and its Applications”, Report No. 13/2004, Mathematisches Forsc...
Ngày tải lên : 07/08/2014, 13:21
  • 11
  • 208
  • 0
Báo cáo toán học: "Improved Upper Bounds for the Laplacian Spectral Radius of a Graph" docx

Báo cáo toán học: "Improved Upper Bounds for the Laplacian Spectral Radius of a Graph" docx

... degree and the average 2-degree of the vertices. As a matter of fact, we can also utilize other characteristics of the vertex to estimate the Laplacian spectral radius of graphs. The definition of ... is also called the Laplacian spectral radius. Let K(G) = D (G ) + A( G). It is called the signless Laplacian matrix of G (or Quasi-Laplacian). A semiregular biparti...
Ngày tải lên : 08/08/2014, 12:23
  • 11
  • 319
  • 0
Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

... is the Euler characteristic of the surface, B depends on the type of map, and A depends on both the type of map and the surface. See [22] for a proof of (7) for the unrooted case and for further ... jbell@math.ucsd.edu) Edward A. Bender Department of Mathematics University of California, San Diego La Jolla, CA 92903-0112, USA (email: ebender@ucsd.edu) Peter...
Ngày tải lên : 07/08/2014, 06:20
  • 22
  • 344
  • 0
Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf

Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf

... bound for the sum of the M 2 pairwise Hamming distances. For the left-hand-side, note that since the Hamming distance between distinct codewordsisatleastd, the sum of the Hamming distances taken ... combinatorial constraints have applications to DNA barcoding and DNA computing (see e.g. [17] and the references therein). The goal is to design libraries that are as large...
Ngày tải lên : 07/08/2014, 07:21
  • 13
  • 280
  • 0
Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps

Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps

... (55) The constants and terms with N are the same for all tableaux with k entries, so the probability that a random tableau of size N contains the subtableau T of shape µ as its subtableau of size ... probabilities approach f µ /k! as expected. We have a similar formula for up-down tableaux; the probability approaches f µ /k!ifµ has k cells and thus the up-down tablea...
Ngày tải lên : 07/08/2014, 08:22
  • 22
  • 378
  • 0
Báo cáo toán hoc:" Bounds on the Distinguishing Chromatic Number" pptx

Báo cáo toán hoc:" Bounds on the Distinguishing Chromatic Number" pptx

... L emma shows that the automorphism group of the join of a particular set of graphs is the product of the automorphism gro ups of the individual graphs. Hemminger [7] addressed a more general version ... chromatic number χ D (G) of a graph G and prove results about χ D (G) based on the underlying graph G. In particular, they find χ D (G) for vario us families...
Ngày tải lên : 08/08/2014, 01:20
  • 14
  • 187
  • 0
Tài liệu Báo cáo khoa học: Enzymes for the NADPH-dependent reduction of dihydroxyacetone and D-glyceraldehyde and L-glyceraldehyde in the mould Hypocrea jecorina doc

Tài liệu Báo cáo khoa học: Enzymes for the NADPH-dependent reduction of dihydroxyacetone and D-glyceraldehyde and L-glyceraldehyde in the mould Hypocrea jecorina doc

... by the Maj and Tor Nes- sling Foundation and PR was an Academy Research Fellow of the Academy of Finland. References 1 Baliga BS, Bhatnagar GM & Jagannathan V (1964) Nicotinamide adenine ... l-Glyceraldehyde was suggested to be generated in the catabolic pathway for d-galacturonate (Kuorelahti et al., unpublished results). In these pathways, the sugar acids d-gluco- nate, d-...
Ngày tải lên : 19/02/2014, 06:20
  • 7
  • 510
  • 0
Báo cáo hóa học: " Procedure for the steady-state verification of modulation-based noise reduction systems in hearing instruments" doc

Báo cáo hóa học: " Procedure for the steady-state verification of modulation-based noise reduction systems in hearing instruments" doc

... MATLAB ® technical comp uting environment. The signals were presented via a digital-to-analog converter (D /A) of the input/output card, an audio amplifier (Amp. A) and the loudspeaker of the measurement ... which the energy in subband b canhaveanimpactonothersub- bands , these now have modulation peaks, which are only affected in a negligible way if additional energy e...
Ngày tải lên : 20/06/2014, 22:20
  • 20
  • 415
  • 0
Từ khóa: