Show simple item record

dc.contributor.authorSurani, Muhammad Adib
dc.date.accessioned2018-07-19T23:16:46Z
dc.date.available2018-07-19T23:16:46Z
dc.date.issued2018en_US
dc.identifier.urihttp://hdl.handle.net/11343/214165
dc.description© 2018 Dr. Muhammad Adib Surani
dc.description.abstractThis thesis focuses on the problem of determining the isoperimetric numbers of Levi graphs of balanced incomplete block designs. We study two versions of this: the vertex-isoperimetric number and the edge-isoperimetric number. In the general case, we manage to obtain strong upper and lower bounds on these numbers for Levi graphs of arbitrary block designs. We also obtain stronger or even exact values for some families of graphs, particularly those arising from finite geometries or difference sets.en_US
dc.rightsTerms and Conditions: Copyright in works deposited in Minerva Access is retained by the copyright owner. The work may not be altered without permission from the copyright owner. Readers may only download, print and save electronic copies of whole works for their own personal non-commercial use. Any use that exceeds these limits requires permission from the copyright owner. Attribution is essential when quoting or paraphrasing from these works.
dc.subjectisoperimetric numberen_US
dc.subjectblock designsen_US
dc.subjectLevi graphsen_US
dc.titleThe isoperimetric problem in block designsen_US
dc.typePhD thesisen_US
melbourne.affiliation.departmentSchool of Mathematics and Statistics
melbourne.affiliation.facultyScience
melbourne.thesis.supervisornameZhou, Sanming
melbourne.contributor.authorSurani, Muhammad Adib
melbourne.accessrightsOpen Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record