Dissertation > Excellent graduate degree dissertation topics show

Special Graph Series XA and Basic Maximal （m+1）K2-free Graph

Author: YaoXiaoMin
Tutor: SongXiaoXin
School: Henan University
Course: Applied Mathematics
Keywords: induced matching induced matching number basic maximal 2K2-free graph basic maximal （m+1）K2-free graph
CLC: O157.5
Type: Master's thesis
Year: 2009
Downloads: 1
Quote: 0
Read: Download Dissertation

Abstract


Since 1980s,grape matching thery has playde an increasing prominent role in the combination of mathematics,operations and contory theory, especially in the recent years,it has become one of the most active core issues dealing with the optimization of Graph matching theory and combination. Meanwhile export matching has been a new research directions developed in the past years.A matching M of G is induced if E（V（M））=M.The induced matching number of G,denoted by IM（G）,is the number of edges of a maximum induced matching of G.is there a connected but not complete simple graph G,such that for each pair of nonadjacent vertices x and y,IM（G+xy）=IM（G）+1?.This problem is fundamental and very interesting.Xie yan-tao senior schoolmate has already soveld the problem,finding 12,13,14 vetices points to match the export of a number of plans to meet the conditions above,In this paper,a special diagram type XA and the definition of XA have been studied and the grape nature will be studide,Which has a direct link with the study of the special type of XA map and the basic structure of a great（m+1）K2-free research,In addition, this article will also continue to study the basic great plan 2K2-free and construct some 2K2-free grape of order 14,15,16.

Related Dissertations

  1. Some New Results of Matching Extendable Graphs,O157.5
  2. Induced Matching Extendable Graphs with Edge-deletable or Vertex-deletable,O157.5
  3. About 2k k edges can be deleted and can be deleted induced matching extendable graphs of some of the results,O157.5
  4. Step 1 and k loop export match scalability,O157.5
  5. The Induced Matching Extendability of Uniform Hypergraphs,O157.5
  6. Cover the Vertices of a Graph by Induced Matchings,O157.5
  7. Some Results on Maximum Matchings of Graphs,O157.5
  8. Basic Maximal （m+1）K2-free Graph,O157.5
  9. The Induced Matching Extendability of Graphs,O157.5
  10. Some Results on Induced Matching,O157.5
  11. On Ohba’s Conjecture of One Class of Complete Multipartite Graphs,O157.5
  12. Analysis of Complex Networks Modeling and Its Application,O157.5
  13. About two parameters characteristic polynomial and its applications,O157.5
  14. Several studies for scheduling problem,O157.5
  15. Multi-attribute undirected weighted graph clustering method,O157.5
  16. The composite equilibrium existence of the network and its algorithm,O157.5
  17. Random Network Model Discrimination,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. Complex network reliability evaluation research,O157.5

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