Dissertation > Excellent graduate degree dissertation topics show

Semisymmetric Graphs of Order 6p~2 and Prime Valency

Author: HanHua
Tutor: LuZaiPing
School: Nankai University
Course: Applied Mathematics
Keywords: Semisymmetric graph bi-coset graph quotient graph normal cover primitive permutation group
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 7
Quote: 0
Read: Download Dissertation

Abstract


The study of semisymmetric graphs has a long history, which is still a hot topic in algebraic graph theory. In this thesis, we investigate the classification problem of semisymmetric graphs of prime degree.LetΓbe a graph. The graphΓis called vertex-transitive or edge-transitive if AutΓ, the automorphism group ofΓ. acts transitively on the vertex set or the edge set. respectively. An arc ofΓis an ordered adjacent pair of vertices andΓis called arc-transitive if AutΓacts transitively on the set of arcs ofΓ. A regular graphΓthat is edge-transitive but not vertex-transitive is called a semisymmetric graph. AndΓis called half-transitive if it is vertex-transitive and edge-transitive but not arc-transitive. A regular edge-transitive graph must be arc-transitive, half-transitive or semisymmetric. Each of the above three families of edge-transitive graphs has been extensively studied in the last few decades. Thus it is meaningful to characterize and classify edge-transitive graphs.We aim to investigate semisymmetric graphs of order 6p2 and of prime degree. In [21], Lu and others gave a group-theoretic description of semisymmetric graphs of prime degree, which prove that, by considering minimal normal subgroups of the automorphism group, a semisymmetric graph of prime degree must be one of the seven types. We use this result to analyze this kind of graph which is of order 6p2 and of prime degree.In this thesis, we first give a classification of the quasiprimitive permutation group of degree dividing 3p2, and then, on the basis of the classification result, we give a complete list of semisymmetric graphs of order 6p2 and of prime degree, and prove that, for odd primes k and p, a connected graphΓof order 6p2 and degree k is semisymmetric if and only if k=3, either p=3 or p≡1(mod 6) andΓis isomorphic to one of two known graphs.In our work, we employ extensively group-theoretic results and methods. such as representation of groups, some classification results on primitive groups and on maximal subgroup of finite simple groups, and so on. We also use in the argument some combinatorial techniques and results about elementary number theory.

Related Dissertations

  1. The Zpq×Zp-Regular Coverings of K3,3,O157.5
  2. The Spectra of Some Lattice Graphs on Surfaces,O157.5
  3. The 3 degrees 4pq order connectivity semisymmetric Figure,O157.5
  4. pq order nonorientable regular map and the second small -order double primitive semi- symmetric graph classification,O157.5
  5. Several Problems of Graph and Group,O152.1
  6. Classifications and Enumerations of Several Families of Symmetric Graphs,O157.5
  7. Half-arc-transitive Graph and Half-edge-transitive Graph,O157.5
  8. On Ohba’s Conjecture of One Class of Complete Multipartite Graphs,O157.5
  9. Analysis of Complex Networks Modeling and Its Application,O157.5
  10. About two parameters characteristic polynomial and its applications,O157.5
  11. Several studies for scheduling problem,O157.5
  12. Multi-attribute undirected weighted graph clustering method,O157.5
  13. The composite equilibrium existence of the network and its algorithm,O157.5
  14. Random Network Model Discrimination,O157.5
  15. Chromatic Equivalent Graphs of Two Kinds of Graphs,O157.5
  16. The General Methods of Studying the Spectra of Graph,O157.5
  17. The Supply Chain Modeling and Network Efficiency Research Based on Complex Network,O157.5
  18. Complex network reliability evaluation research,O157.5
  19. M (?) Bius cubes crossing number of graphs,O157.5
  20. Local tolerance studies twisted cube LTQ_n,O157.5
  21. Augmented Cubes AQn graph the number of crossing boundaries,O157.5

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