Báo cáo toán học: "The spectral flavour of Scott Brown''''''''s techniques " pot

Báo cáo toán học: "The spectral radius and the maximum degree of irregular graphs" doc

Báo cáo toán học: "The spectral radius and the maximum degree of irregular graphs" doc

... (1), we improve some recent results of Nikiforov [16] regarding the spectral radius of a subgraph of a regular graph. We also investigate the spectral radius of a graph obtained from a regular ... the spectral radius of a general (not necessarily regular) graph G and that of a subgraph of G, see [16]. 2 The spectral radius and the maximum degree The following theorem is...

Ngày tải lên: 07/08/2014, 15:22

10 318 0
Báo cáo toán học: " The Translational Hull of a Strongly Right or Left Adequate Semigroup" pdf

Báo cáo toán học: " The Translational Hull of a Strongly Right or Left Adequate Semigroup" pdf

... eρ + ,andeρ + ∈ E; (ii) λ + e =(λe) + . Proof. (i) Since we assume that the set of all idempotents E of the semigroup S forms a semilattice, all idempotents of S commute. Hence, λ + e =(λe) + e = ... set P (S) of all right translations) of the semigroup S forms a semigroup under the composition of mappings. By the translational hull of S, we mean a subsemigroup Ω(S) consisting...

Ngày tải lên: 06/08/2014, 05:20

7 347 0
Báo cáo toán học: "The Quantum Double of a Dual Andruskiewitsch-Schneider Algebra Is a Tame Algebra" pdf

Báo cáo toán học: "The Quantum Double of a Dual Andruskiewitsch-Schneider Algebra Is a Tame Algebra" pdf

... general- ization of [7], of (A(n, d, μ, q)) ∗cop . Our main result is to give the structure of projective modules of D(Γ n,d ). By this, we give the Ext-quiver (with relations) of D (Γ n,d )andshowthatD(Γ n,d ) ... > − −1, the elements X s K u,j and X s  F u,j are linearly independent. Proof. The proof of this lemma is same to the proof of Lemma 2.18 in [7]. For completeness...

Ngày tải lên: 06/08/2014, 05:20

19 386 0
Báo cáo toán học: "The independence number of graphs with large odd girth" ppt

Báo cáo toán học: "The independence number of graphs with large odd girth" ppt

... independence number of general graphs of a given odd girth. We shall prove some similar bounds to those we prove for regular graphs in terms of a measure of the concentration of edges. Monien and ... for the independence number in terms of the odd girth, but instead of the average degree of the graph we have to use another measure of the concentration of edges. 8 Reference...

Ngày tải lên: 07/08/2014, 06:20

12 356 0
Từ khóa:
w