Dissertation > Excellent graduate degree dissertation topics show

Tutte Uniqueness of Several Kinds of Line Graphs

Author: LiWenQiao
Tutor: HaoRongXia
School: Beijing Jiaotong University
Course: Basic mathematics
Keywords: Tutte polynomials line graphs the uniqueness of Tutte polynomials Ladders dodecahedron
CLC: O157.5
Type: Master's thesis
Year: 2010
Downloads: 20
Quote: 0
Read: Download Dissertation

Abstract


The study of graph polynomials has been an active research topic for many years. It serves as a bridge between graph theory and traditional algebra. Since the coefficients of polynomials often contain rich combinatorial information, the study of graph polynomials provides new avenues to understand the complicated structures of graphs and graphic parameters.In the articles which study the properties and applications of a graph, some polynomials such as the matching polynomial, the chromatic polynomial, the flow polynomial, the Tutte polynomial, the genus distribution polynomial, and the total embedding distribution polynomial are used to describe the graphs. Among which, the chromatic polynomial, the flow polynomial, and the Tutte polynomial are three important graph polynomials in the graph theory. They have a close relationship with each other. The flow polynomial can be considered as the dual of the chromatic polynomial, and both of them are evaluations of the Tutte polynomial. Therefore, many studies in recent years are focused on the Tutte polynomial and graphs that can determined uniquely by the Tutte polynomial.This paper mainly studies the uniqueness of Tutte polynomial of line graphs. We say that a graph G is T-unique if any other graph having the same Tutte polynomial as G is isomorphic to G. The Tutte polynomial of a graph is an important part of graph theory. It not only has many relationships with matriod and chromatic polynomials, but it also contains a lot of information about the graph, such as the number of vertices, the number of edges, and so on. What is more, some families of graphs are determined by their Tutte polynomial.Some scholars have done a lot of research about the uniqueness of Tutte polynomial, and the uniqueness for several families of graphs and line graphs have been discussed. But little is known about the uniqueness of Tutte polynomial for most line graphs.In this paper, we study the uniqueness of Tutte polynomial of two kinds of line graphs--the line graph of Ladders L(Ln) and the line graph of the dodecahedron on the basis of the previous research.In chapter one, we introduce the concepts and background of the uniqueness of Tutte polynomial. In addition, we give the structure and the content of each chapter of this paper briefly.In chapter two, we study the uniqueness of Tutte polynomial of the line graph of Ladders L(Ln) and obtain the following conclusion:If H has the same Tutte polynomial with L(Ln) and H is a plane graph, then H is isomorphic to L(Ln)for n≥6n and n≠4i, i=2,3…; and they are not T-unique for n=4i and i=2,3….In chapter three, we prove the line graph of the dodecahedron is T-unique.

Related Dissertations

  1. Study the Methods on City DLG Data Processing and Data Loading,P208
  2. Simulation on the Effective Thermal Conductivity of Porous Ceramic Foam and Analysis of Experimental Method,TQ174.1
  3. Acute Triangulations of Polyhedral Surfaces,O157.3
  4. Overall Mechanical Structure Design and Movement Analysis of Lower Limb-walking Training Robot for Rehabilitation,TP242
  5. Double-edged Effects of Technology Gap and Non-Linear Technology Spillovers of FDI: Theory and Empirical Study,F830.7;F204
  6. Industrial Gradient Transference and Zhanjiang City’s Industrial Acceptance,F127
  7. Orlik-Solomon Algebras and Tutte Polynomials of a Class of Graphic Arrangements,O157.5
  8. Study on Preparation and Properties of BaSnO3 Based Dye-sensitized Solar Cells,TM914.4
  9. Some Topics on K-Perfect Hypergraphs,O157.5
  10. Research on Loading Methods for Load Cell’s Load Characteristic Test,TP212
  11. The Investigation on the Crossing Numbers of the Line Graphs and Some Classical Graphs,O157.5
  12. L(2,1)-Edge-Labeling of Graphs,O157.5
  13. Scientific Visualization System and HFFT Over Non-Tensor Product Domains,TP391.4
  14. Hamilton Cycles and List Linear Arboricity of Graphs,O157.5
  15. Higher Order Connectedness of Graphs and Digraphs,O157.5
  16. Research on Elastic Properties and Thermal Conductivity of Cellular Ceramic Materials,TB383.4
  17. Undirected cycle diagram and generalized de Bruijn digraphs and Eulerian tour spanning tree count,O157.5
  18. The Signless Laplacian Spectral Radius with Some Graphs,O157.5
  19. Optimization Research and Its Performance Analysis on the Transfer Model of Weighted Public Transport Networks,O157.5
  20. Cayley Graphs of Small Valencies of a Group of Order 4p~2,O157.5
  21. Social Network and SPC Analysis,O157.5

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