Dissertation > Excellent graduate degree dissertation topics show

On Radio Colorings and Hamiltonian Colorings of Some Graphs

Author: GuoJun
Tutor: ShenYuFa
School: Hebei University of Technology
Course: Applied Mathematics
Keywords: Radio coloring antipodal chromatic number nearly antipodal chromatic number Hamiltonian coloring Hamiltonian chromatic number
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 6
Quote: 0
Read: Download Dissertation

Abstract


Graph colorings belong to classical graph theoretical problems. Graph coloring theory has a central position in discrete mathematics, and has plenty of theoretical results and extensively practical applications. In the latest years, a lot of research papers appeared in the field of restricted colorings of graphs. Restricted color-ings of graphs is a generalization of standard coloring of graphs. Radio colorings and Hamiltonian colorings of graphs are both of them. In the last decade, Radio colorings and Hamiltonian colorings of graphs have been becoming the hottest researching points for many scientists in the world scale. A large number of scien-tists of graph theory pay significant attention to Radio colorings and Hamiltonian colorings of some simple classes of graphs. In this paper, we researched some issue of Radio colorings and Hamiltonian colorings.This paper includes seven chapters:The first chapter is introduction, introduc-ing the phylogeny of graph theory, and the researching purpose and meanings of this paper; The second chapter is preparative knowledge. We give some infor-mation of graph and some concepts of graph; In the third chapter, we introduce the current situations and obtained consequences on Radio colorings and Hamil-tonian colorings; In the forth chapter, we discuss the proof of proof of antipodal chromatic number of paths,point out that there are several errors in the proof and give another correct proof; In the fifth chapter, we confirm the nearly antipodal chromatic number of even paths; In the sixth chapter, we confirm the Hamiltonian chromatic number of a class of generalized stars; In the last chapter, we sum up what we have done in this paper.

Related Dissertations

  1. On Hamiltonian Colorings for Some Graphs,O157.5
  2. Hamiltonian Colorings of Some Caterpillars,O157.5
  3. Pseudo Greedy Algorithm and upper Bound for Hamiltonian Chromatic Number of Paths,O157.5
  4. On Ohba’s Conjecture of One Class of Complete Multipartite Graphs,O157.5
  5. Analysis of Complex Networks Modeling and Its Application,O157.5
  6. About two parameters characteristic polynomial and its applications,O157.5
  7. Several studies for scheduling problem,O157.5
  8. Multi-attribute undirected weighted graph clustering method,O157.5
  9. With Regard to a Number of Writing Method of Cyclic Codes,O157.4
  10. The Adjoint Polynomial and the Chromaticity of Several Kinds of Graphs,O157.5
  11. Research on Some Bipartite Graphs Energy,O157.5
  12. The Spectral Characterization of Graph with Odd Circuits,O157.5
  13. The composite equilibrium existence of the network and its algorithm,O157.5
  14. Network based on the provision of public goods countermeasures study strategic interaction and equilibrium problems,O157.5
  15. Random Network Model Discrimination,O157.5
  16. Application of Inclusion Principle Based on Graph Theory in Interconnected Large-scale Systems,O157.5
  17. Several Graphs properties of adjoint polynomials,O157.5
  18. Chromatic Equivalent Graphs of Two Kinds of Graphs,O157.5
  19. The General Methods of Studying the Spectra of Graph,O157.5
  20. The Supply Chain Modeling and Network Efficiency Research Based on Complex Network,O157.5
  21. Several three chromatic uniqueness,O157.5
  22. Consensus in Complex Dynamic Network of Multi-Agent Based on LMI Method,O157.5

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