Dissertation > Excellent graduate degree dissertation topics show

Some of the results of the X - ring ( Road )

Author: WuQiong
Tutor: SunZhiRen
School: Nanjing Normal University
Course: Operational Research and Cybernetics
Keywords: Three connected graph X- ring X- Road X- longest ring X - longest road X- control ring X- Control Road X- can circle graph Degree and κ- decomposition σ_κ (X)
CLC: O157.5
Type: Master's thesis
Year: 2007
Downloads: 26
Quote: 0
Read: Download Dissertation

Abstract


Let G = (V, E) n points in three connected graph, so that X (?) V (G). C for G in the ring, for G arbitrary ring C 'have | X ∩ V (C) | ≥ | X ∩ V (C') |, the ring C is called the longest X-ring. We use α (G) the independence number of a graph G, α (X) represents the independence number of G [X]. When k> α (X) seasonal σ k (X) when k ≤ α (X) can form independent set of k points degrees (in G) minimum value of X; σ k (X) = k (n-α (X)). Let X (?) V (G), P is the way in Figure G, if X (?) V (P), then P is called the X-channel. If n is a positive integer and N = the Σ i = 1 K n i and the the N i ≥ 2 ( 1 ≤ i ≤ k), wherein n i (1 ≤ i ≤ k) are integers, called (n to 1 , n 2 , ..., n k ) as a n, k-decomposition. [4] Zou Park made the following conclusions: G n points connected graph, C is the longest cycles in G R = G \\ C, if σ 4 (G) ≥ n 6, then G [R] in any of a communicating branch H satisfy | V (H) | ≤ 2. Conditions in the σ 4 (G) to make changes that take V (G), a subset of X, σ 4 (G) improved as σ < sub> 4 (X), while on the conclusions for further discussion we get the first conclusion: G for three connected graph of the n points, and X (?) V (G), C is an X- The longest cycle, if σ 4 (X) ≥ n, then for any G \\ C a connected component of H have | V (H) ∩ X | ≤ 2, and with exactly two The point X in the communicating branch is not a point outside the X-containing. The easy Seeing conclusion of [4] Zou Park conclusions promotion. [8] Enomoto et al: G n points connected graph σ 3 (G) ≥ n or α (G) ≤ 2, then G Hamilton Road or G in the longest cycles are strong control circle. This conclusion part of the improvement, obtained second conclusion of this paper: G is a connected graph of n points, X (?) V (G), if α (X) ≤ 2, then G with X-road. Visible second conclusion of this paper to promote some of the conclusions of Enomoto Theorem. Conclusion: G n points connected graph is given in [6] Chen Yaojun, if σ 3 (G) ≥ (3n-5) / 2, then G Hamilton Road. Their improvement obtained herein third conclusion: G is a connected graph of the n points, X (?) V (G), if the the σ 3 (X) ≥ (3n-5) / 2, then G X-Road. This conclusion conclusions promotion Chenyao Jun et al. Similarly, Robert Jahansson given in [7]: G n points connected graph, given n a k-decomposition (n 1 n 2 ... , n k ) and n i (1 ≤ i ≤ k) is odd, if G path P so that (?) v ∈ V (G) \\ V (P) are not successive adjacent points on P and d P (v) ≥ [n 1 / 2] [n disjoint paths the n k point. Improvement This conclusion was this fourth conclusion: G n points connected graph X (?) V (G) | X | = s (s 1 , s 2 , ..., s k ) s, a k-decomposition s i (1 ≤ i ≤ k) is odd. Let G be a path P such that any x ∈ X \\ V (P) has | N P (x) ∩ X | ≥ [s to 1 / 2] [s 2 / 2] ... [s k / 2] and x in P will not have one after another neighbor point in X, then G bit cross road P < sub> 1 , P 2 , ..., P k so | the P i ∩ X | the = s i < / sub> (i = 1,2 ..., k). Easy see Robert Jahansson conclusions for fourth conclusion inference. In the last chapter, we propose some future research may be thinking about the problem.

Related Dissertations

  1. Research on Transfer Alignment of the Missile Onboard the Aircraft,V249.322
  2. Partical Combination of Fine Powder Effect on Performance of Cement and Concrete,TU528.041
  3. Research of Irreversible Loss in Flow and Mexed Prosess,TK12
  4. Effects of Intensitive Cycling of Papermaking Water on Sizing and Its Improvement,TS727.5
  5. Research on the Coordination Degree Evaluation of Fuzhou Sanfangqixiang Tourist Attraction and Its Setting,X820.3
  6. Hydrophilic structure of different types of surface -modified polyurethane material and coagulation 12 factor nine peptide fragments,and fibrinogen P1 fragment of computer simulation of the interaction,O631.3
  7. The Study of the Fitness Difference of Helicoverpa Armigera (Hübner) and Helicoverpa Assulta (Guenée) Fed with Different Pepper Varieties,S436.418
  8. The Study of Life Parameters on Different Photopreiods of Mirid and Physiological Index on Host Plant Infested by Mirid,S435.622
  9. Survey on Excellent Thesis for Gymnastic Master’s Degree,G643
  10. Fuzzy Programming Approach for Solving Multilevel Programming Problem,O221.2
  11. Grey System Theory and the Comparison of Related Models,N941.5
  12. Academic Degree Program Development and Research Strategies,G643
  13. The effect of education on the extent of crime analysis,D917
  14. \u00C2\u00BF \u00BE ??C ?? CY \u00BF??\u00A5\u00A5 C?? \u00AF \u0153\u00E6 ?? '\u00E6 ? ?? ?? S11 \u301C,TD745
  15. Fractional Differential resonance boundary value problems,O175.8
  16. Analysis of Jujube Growers’ Channel Choice and Satisfaction Level of Agricultural Services in Aksu,F326.12
  17. Study on Financial Support to the Development of Photovoltaic Industry in Xinyu City,F832.2
  18. The Diversification Strategy Research of Coal Enterprises Based on Capabilities,F426.21
  19. Study on Tourism Climate Comfort in Shuozhou,P49
  20. A Summary of the Theses for Master’s Degree in Mongolian-Chinese Translation at N.W.University for Nationalities(1997-2009),H212
  21. Research on the Degree of Satisfaction of the Staff in Medium and Small Private Enterprises,F272.92

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net  Mobile