Full metadata record
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.contributor.advisorQi, Liqun (AMA)-
dc.contributor.advisorLi, Xun (AMA)-
dc.creatorOuyang, Chen-
dc.identifier.urihttps://theses.lib.polyu.edu.hk/handle/200/9670-
dc.languageEnglishen_US
dc.publisherHong Kong Polytechnic University-
dc.rightsAll rights reserveden_US
dc.titleSpectral hypergraph theory via tensorsen_US
dcterms.abstractThe thesis is devoted to a few problems on spectral hypergraphs theory via the adjacency tensor, Laplacian tensor and signless Laplacian tensor of a hypergraph. These problems are analogy and generalization of problems usually concerned in spectral graph theory. Three topics are included: 1. Characterization of uniform hypergraphs with largest spectral radii under certain conditions. 2. The property of symmetric spectrum for uniform hypergraphs with applications. 3. Properties on the spectra of non-uniform and general hypergrpahs. For the first topic, two types of connected hypergraphs with fixed vertex number and cyclomatic number called unicyclic and bicyclic hypergraphs are studied. By combining recent developed spectral techniques, the first five hypergraphs with largest spectral radii among all unicyclic hypergraphs and the first three over all bicyclic hypergraphs are determined, together with two orderings of the corresponding hypergraphs. For topic 2, we investigate the newly introduced odd-colorable hypergraphs and employ their symmetric spectra to obtain conditions for a uniform hypergraph to have equal Laplacian spectrum and signless Laplacian spectrum. For the last topic, some spectral bounds in terms of graph invariants are extended from uniform case to general hypergraphs, and a new way is found to bound the spectral radius from below for a special class of non-uniform hypergraphs. Moreover, the property of symmetric spectrum for general hypergraphs is investigated. Equivalent conditions are extened from uniform case to general case. Besides, the capability of a non-uniform hypergraph to have symmetric (H-)spectrum, equal Laplacian (H-)spectrum (spectral radius) and signless Lapalcian (H-)spectrum (spectral radius) is discussed.en_US
dcterms.extentxvi, 87 pages : illustrationsen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.issued2018en_US
dcterms.educationalLevelPh.D.en_US
dcterms.educationalLevelAll Doctorateen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.LCSHCalculus of tensorsen_US
dcterms.LCSHHypergraphsen_US
dcterms.accessRightsopen accessen_US

Files in This Item:
File Description SizeFormat 
991022165758203411.pdfFor All Users859.94 kBAdobe PDFView/Open


Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show simple item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/9670