{"id":{"repo_id":"udel","oai_identifier":"oai:udspace.udel.edu:19716/17682"},"canonical_url":"https://search.dev.ndltd.org/etd/udel/oai:udspace.udel.edu:19716/17682","repository":{"repo_id":"udel","name":"University of Delaware","base_url":"https://udspace.udel.edu/server/oai/request"},"display":{"title":"Algebraic methods in graph theory","abstract":"The algebraic methods have been very successful in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of strongly regular graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs.","abstract_html":"The algebraic methods have been very successful in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of strongly regular graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs.","abstract_has_math":false,"creators":["Li, Weiqiang"],"institution":"University of Delaware","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-07-24T05:11:22Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.58088/a53t-cc68"],"render_values":[{"text":"https://doi.org/10.58088/a53t-cc68","href":"https://doi.org/10.58088/a53t-cc68","code":true}]}]},"links":{"outbound_url":"http://udspace.udel.edu/handle/19716/17682","outbound_label":"Repository record","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Li, Weiqiang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-04-26T12:08:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-04-26T12:08:21Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["University of Delaware"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.58088/a53t-cc68"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://udspace.udel.edu/handle/19716/17682"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The algebraic methods have been very successful in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of strongly regular graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Algebraic methods in graph theory"]}]}],"canonical_facts":{"dc:creator":["Li, Weiqiang"],"dc:date.accessioned":["2016-04-26T12:08:21Z"],"dc:date.available":["2016-04-26T12:08:21Z"],"dc:date.issued":["2015"],"dc:description.abstract":["The algebraic methods have been very successful in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture of Brouwer, concerning the second connectivity of strongly regular graphs. Finally, we compute the extendability of matchings for many strongly regular graphs and many distance-regular graphs."],"dc:description.degree":["Ph.D."],"dc:identifier.doi":["https://doi.org/10.58088/a53t-cc68"],"dc:identifier.uri":["http://udspace.udel.edu/handle/19716/17682"],"dc:publisher":["University of Delaware"],"dc:title":["Algebraic methods in graph theory"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T05:11:22Z"}