Báo cáo toán học: "Stability of Graphs" ppt

... bijection between the set of vertices of G and the set of vertices of H. We now show that given any pair a, b of vertices of G (which might also coincide), the set E(a, b) of edges between these ... journal of combinatorics 16 (2009), #N6 1 of f(a) and thus the 3ε-neighborhood of f (a) is a simple arc (lying in the interior of some edge) in H. Consider the points a 1 , a...

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

... µ, ν of n we obtain a lower bound on n, depending on λ, µ, ν, for the stability of the multiplicity c(λ, µ, ν )of ν in χ λ ⊗ χ µ .Our proof is purely combinatorial. It uses a description of the ... the set of partitions of n together with the dominance order, see [1, 3, 5, 7]. Let H be a subgroup of a group G.Ifχis a character of H we denote by Ind G H (χ) the induction charact...

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

... V (G). A composition of G is a partition of V (G) into vertex sets of connected induced subgraphs of G. Thus a composition provides a set of connected induced subgraphs of G, {G 1 , G 2 , · · ... composition of a graph G is a partition of the vertex set of G into vertex sets of connected induced subgraphs of G. Knopfmacher and Mays [2] found an explicit formula for C(K m...

Ngày tải lên: 07/08/2014, 13:21

Ngày tải lên: 05/08/2014, 09:46

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

... problems for the integral closures of powers of a monomial ideal. 2. Integer Solut ions of Linear Constraints Let S be the set of integer solutions of the following system of linear constraints  a i1 x 1 + ... sections. The first one is of preparatory char- acter. There we will give a bound for the degrees of generators of a module raised from integer solutions of a system...

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

... of G is a set of subgraphs G 1 , ,G t such that any edge of G is an edge of exactly one of G 1 , ,G t and all G 1 , ,G t ∈ .Letφ(G, ) denote the minimum size of an -decomposition of G. The main ... non-complete graph of order 4. 1 Introduction Let G be a simple graph with vertex set V and edge set E. The number of vertices of a graph is its order.Thedegree of a vertex v...

Ngày tải lên: 07/08/2014, 13:21

... vertices of degree 1 and q vertices of degree n −2. Suppose that q = 1, p ≥ 2 and that one of the pendant vertices is not adjacent to the vertex of degree n −2. Then G is not an NT graph. Proof: Suppose, ... eigenvalue of multiplicity δ −1 or δ. If the multiplicity of n as an eigenvalue of G is δ, then G can be written as a join of δ + 1 graphs, say G = H 1 ∨. . . ∨H δ+1 . Sin...

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

... repeat of u (and vice versa) in G. Clearly, when defect is 2, R(G) is either one cycle of length n = |V (G)| or a disjoint union of cycles whose sum of lengths is equal to n. If R(G) is cycle of ... electronic journal of combinatorics 18 (2011), #P71 4 Nonexistence of graphs with cyclic defect Mirka Miller ∗† School of Electrical Engineering and Comp. Science, University of...

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

... crlin@ntut.edu.tw 1 Department of Mechanical Engineering and Institute of Manufacturing Technology, National Taipei University of Technology, Taipei, 106, Taiwan Full list of author information is available at the end of ... beamline of the National Synchrotron Radiation Research Center (NSRRC). This work was financially supported by the main research projects of the National Sc...

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