Dissertation > Excellent graduate degree dissertation topics show

Symbol mode of minimal rank

Author: LeiLi
Tutor: HuangTingZhu
School: University of Electronic Science and Technology
Course: Computational Mathematics
Keywords: minimum rank minimum semi-definite rank sign pattern matrix graph
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 44
Quote: 0
Read: Download Dissertation

Abstract


The minimum rank problems of sign patterns play an important role in the fields such as singular graph theory, hermitian rank and the computation of the communication complexity. Using graph, the minimum rank and the semi-definite rank for combinatorial symmetric sign patterns are discussed.The development of minimum rank problem is introduced. The equivalence between the sign pattern and graph is also given, that is to say, the study of minimum rank problem for sign pattern and that for graph is equivalent under some special conditions.Combinatorial symmetric sign patterns are considered. What we concerned more is the symmetric minimum rank. Firstly, we introduce several definitions and related results, based on which we obtain a lower bound of the minimum rank for particular sign patterns. More specifically, we show that the minimal rank equal to zero forcing number for graphs such as Ct （ Kr）、St （ Kr）、Ct （ Kr）-u、St（ K3） -v .Secondly, we prove that the minimal rank of Halin graph constructed by a star or a double star is the order of the graph minus three. In addition, the minimum rank of the lotus leaf withm outer vertices is m . In the end, the minimum rank for skew-symmetric sign pattern is considered. We obtain the minimum rank for M&o&b ius ladderand the Corora of two paths.The definition of the minimum semi-definite rank is introduced. The upper and lower bound of minimum semi-definite rank is discussed. A method for constructing an OS-set is proposed, and a lower bound of minimum semi-definite rank for bipartite graph is extended to general graphs. Moreover, the minimum semi-definite rank for the sign patterns corresponding to k-regular graph and Kn which satisfy the equationmsr（G ） = ts（G ） - 1.

Related Dissertations

  1. Research on Graph-Based Algorithm for Tagsnps Selection,Q78
  2. Reseach on Optimal Control of Elevator Group Based upon Ant Colony Algorithm,TU857
  3. Research on Decoding Algorithm for LDPC Codes,TN911.22
  4. Research on Parallel Frequent Graph Pattern Mining,TP311.13
  5. Fault Diagnosis Method Based on Support Vector Machine,TP18
  6. Research on the Platform for Clustering Graph Data and Its Implementation,TP311.13
  7. Research and Software Development on the Basis of the Graph Theory in Road Alignments Modeling,U412.33
  8. Learning Based Structured Image Model Extraction and Tracking,TP391.41
  9. Combinatorial Optimization Via Proposition Reasoning,O224
  10. Hysteresis -based optimization of vehicle routing problem,O224
  11. Based on the geometry of multiple images and textures automatically rebuild,TP391.41
  12. The Zpq×Zp-Regular Coverings of K3,3,O157.5
  13. The Vertex Arboricity of Mycielski Graphs of k-degenerate Graphs,O157.5
  14. Colorings of Distance Graphs and Star Extremality of Circulant Graphs,O157.5
  15. Construction and Random Graphs on Ramsey Theory,O157.5
  16. Eigenvalues and Structural Parameters of Bicyclic Graphs,O157.5
  17. Super 3-restricted Edge Connectivity of Direct Product Graphs,O157.5
  18. The Research and Application of 3D Editing Technology of DLG,P231.5
  19. Research of F-GERT Network Model and Their Application Based on Credibility Theory,C931.1
  20. Spectrum Allocation Based on Graph Theory in Cognitive Radio Networks,TN925
  21. Design and Implementation of Alarm Correlation-based Alarm Subsystem,TN915.06

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