Dissertation > Excellent graduate degree dissertation topics show

Coloring on the Graph

Author: YanZuoMing
Tutor: HanYouFa
School: Liaoning Normal University
Course: Basic mathematics
Keywords: Graph coloring Chromatic polynomial Potts model Knot
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 43
Quote: 0
Read: Download Dissertation

Abstract


The main content of this paper is discussing graph coloring, through discussing the zeros of graphs’ chromatic polynomial, it analyzes the number of ways to vertex-color the graph withcorlors so that no two adjacent vertices receive the same color. Graph coloring problem has connection with knot polynomial and the Potts model. Hence, this paper refers to knot theory and statistical mechanics.The purpose of this review is to introduce a new approach about vertex-coloring. We will compute the later graph’s dichromatic polynomial when the former graph has removed a part one. Through comparing with the former dichromatic polynomial, some topics will be discussed and we will give some general conclusions. To accomplish this, it is necessary to reformulate and rework the existing and known results in knot theory, graph theory and statistical mechanics. Then illustrative calculations for various families of graphs are presented:The first discussed group of graphs are " Trees around n-circuit"; The second discussed group of graphs are "n-arc-move "; The third discussed group of graphs are "trees-move"; The forth discussed group of graphs are "n-circuit-move"; The fifth discussed group of graphs are "unknown graph+bridge"; The sixth discussed group of graphs are "link-move"; The seventh discussed group of graphs are "unknown graphs around n-circuit".Some implications for correlations of the statistical mechanics are mentioned. The partition function is a useful quantity to determine. It was already proved that various thermodynamic quantities can calculate from the partition function.These cases are also applied to square bracket of the associated alternating knot.

Related Dissertations

  1. Preparation and Evaluation of Bio-Organic Fertilizers for Effective Control of Root-Knot Nematodes,S476.1
  2. Study on Inheritance and Molecular Markers of Resistance to the Root-Knot Nematode (Meloidogyne incognita) in Cucumber Introgression Lines,S436.421
  3. Genetic Linkage Map Construction of Prunus. Kansuensis and Molecular Markers for Resistance to Root-Kont Nematode (Meloidogyne Incognita),S662.1
  4. The Spectrum Allocation Scheme Based on Graph Coloring in Cognitive Radio System,TN925
  5. Research on Gate Assignment Optimization Problem at the Airport,TP301.6
  6. Spectrum Allocation Based on Graph Theory in Cognitive Radio Networks,TN925
  7. Airlines aircraft intelligent scheduling problem,F560
  8. Cellular Automation Model Based on the Canonical Ensemble Potts Magnetic System and Its Application,TP301.1
  9. Research on Spectrum Allocation Algorthm in Cognitive Radio,TN925
  10. Cognitive radio spectrum allocation algorithm,TN925
  11. Cognitive radio based dynamic spectrum allocation key technology research,TN925
  12. Research on Spectrum Allocation Algorithm for Cognitive Radio Networks,TN925
  13. Studies on Cryopreservation of Carnation (Dianthus Caryophyllus L.) Germplasm by Droplet-Virtrification,S682.19
  14. Image Data Hiding Schemes Based on Graph Coloring,TP309
  15. Research of Spectrum Allocation Algorithm in Cognitive Radio Networks,TN925
  16. Research on the Critical Group and Chromatical Uniqueness of a Graph,O157.5
  17. Cloning and Localization of Root-knot Nematode Resistance Relative MYB Transcription Factor Genes in Honggengansutao Peach(prunus kansuensis L.),S662.1
  18. Spectrum Allocation Algorithm Based on Graph Theory in Cognitive Radio Networks,TN92
  19. Research on Swarm Intelligence Algorithms Based on Graph Coloring Problem,TP301.6
  20. Studies on Resistance Mechanism to Root-knot Nematode and Temperature Stress for Grafted Watermelon,S651

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