Dissertation > Excellent graduate degree dissertation topics show
The Research on the Fractional Chromatic Number of Graphs
Author: ZhangGuoYuan
Tutor: AYongGa
School: Inner Mongolia Normal
Course: Applied Mathematics
Keywords: Direct product graph Fractional chromatic number Transitive graphs Expansion graph
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 11
Quote: 0
Read: Download Dissertation
Abstract
|
Graph coloring theory is an important area of ??research in graph theory , the Hedetniemi direct product graph coloring conjecture is famous conjecture has not been compromised , score staining the natural stained promotion article discusses direct product graph score staining and greatly expansion score coloring problem First , this article gives the fractional chromatic number of connectivity point pass straight plot Figure this is of Hedetniemi guess the meaning of the scores staining results . Secondly, given the enormous expansion of the direct product graph the fractional chromatic number, which is the fraction of staining in the the expansion graph on a application .
|
Related Dissertations
- About Groups and special semigroups deletion Relationship,O157.5
- The Forward Index of Vertex-transitive Graphs Which Are Determined by Inner Cyclic Group,O157.5
- On Restricted Coloring Problems of Some Special Graphs,O157.5
- Symmetry of Graphs and Embeddings of Graphs into Surfaces,O157.5
- Connectedness of Bi-Cayley Graphs and Bi-Transitive Graphs,O157.5
- Finite Edge-Transitive Graphs,O157.5
- Traceability of Graph and Discussion of Coloring Property of Product of Graphs,O157.5
- Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs,O157.5
- On Conditional Edge Connectedness of Transitive Graphs,O157.5
- A Class of Half-Transitive Metacirculants,O152.1
- The λ3,q-connectivity of Graphs and the Optimally Local-connectivity of Transitive Graphs,O157.5
- Equitable Coloring and Connectivity of Direct Products of Some Graphs,O157.5
- The Fractional Chromtic Numbers and Total Fractional Chromtic Numbers of Some Graphs,O157.5
- On Domination-Stability of Graphs,O157.5
- The Half-arc-transitive Graphs and Integer Flows,O157.5
- Finite s-arc Transitive Graphs,O157.5
- Several Families of Edge-transitive Graphs,O157.5
- Half-arc-transitive Graph and Half-edge-transitive Graph,O157.5
- Hierarchical Algorithms Design and Simulation of Network Topology,TN915.02
- The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs,O157.5
CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net Mobile
|