{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:14170"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:14170","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Feasibility algorithms for distance-biregular graphs","abstract":"A distance-biregular graph is a finite, undirected bipartite graph where any two vertices in the same part of the bipartition have the same intersection array. In this thesis we find necessary conditions for a pair of arrays to correspond to a distance-biregular graph and use these to construct an algorithm for generating all pairs of feasible arrays corresponding to possible graphs of girth four and smallest valency \\(b_0\\)\\(' < 20\\). The feasible arrays with \\(b_0\\)\\(' < 10\\) are analysed in Chapters 5 and 6; those with \\(10 \\leq b_0\\)\\(' < 20\\) are listed in Appendix II. Our results raised a number of interesting questions which are listed at the end of Appendix II.","abstract_html":"A distance-biregular graph is a finite, undirected bipartite graph where any two vertices in the same part of the bipartition have the same intersection array. In this thesis we find necessary conditions for a pair of arrays to correspond to a distance-biregular graph and use these to construct an algorithm for generating all pairs of feasible arrays corresponding to possible graphs of girth four and smallest valency <span class=\"etd-inline-math\">b<sub>0</sub></span>\\(&#x27; &lt; 20\\). The feasible arrays with <span class=\"etd-inline-math\">b<sub>0</sub></span>\\(&#x27; &lt; 10\\) are analysed in Chapters 5 and 6; those with <span class=\"etd-inline-math\">10 \\leq b<sub>0</sub></span>\\(&#x27; &lt; 20\\) are listed in Appendix II. Our results raised a number of interesting questions which are listed at the end of Appendix II.","abstract_has_math":true,"creators":["Secker, Peter Ronald"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1989,"date_issued":"1989-09","date_published":"1989-09","updated_at":"2026-11-19T09:32:30Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/14170/1/Secker1990PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A14170","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["other"]},{"key":"dc:creator","label":"Author","values":["Secker, Peter Ronald"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1989-09"]},{"key":"dc:date.issued","label":"Date","values":["1989-09"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Faculty of Science","Department of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/14170/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/14170/1/Secker1990PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A distance-biregular graph is a finite, undirected bipartite graph where any two vertices in the same part of the bipartition have the same intersection array. In this thesis we find necessary conditions for a pair of arrays to correspond to a distance-biregular graph and use these to construct an algorithm for generating all pairs of feasible arrays corresponding to possible graphs of girth four and smallest valency \\(b_0\\)\\(' < 20\\). The feasible arrays with \\(b_0\\)\\(' < 10\\) are analysed in Chapters 5 and 6; those with \\(10 \\leq b_0\\)\\(' < 20\\) are listed in Appendix II. Our results raised a number of interesting questions which are listed at the end of Appendix II."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Feasibility algorithms for distance-biregular graphs"]}]}],"canonical_facts":{"dc:contributor.sponsor":["other"],"dc:creator":["Secker, Peter Ronald"],"dc:date":["1989-09"],"dc:date.issued":["1989-09"],"dc:description.abstract":["A distance-biregular graph is a finite, undirected bipartite graph where any two vertices in the same part of the bipartition have the same intersection array. In this thesis we find necessary conditions for a pair of arrays to correspond to a distance-biregular graph and use these to construct an algorithm for generating all pairs of feasible arrays corresponding to possible graphs of girth four and smallest valency \\(b_0\\)\\(' < 20\\). The feasible arrays with \\(b_0\\)\\(' < 10\\) are analysed in Chapters 5 and 6; those with \\(10 \\leq b_0\\)\\(' < 20\\) are listed in Appendix II. Our results raised a number of interesting questions which are listed at the end of Appendix II."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/14170/1/Secker1990PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["Faculty of Science","Department of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/14170/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public"],"dc:title":["Feasibility algorithms for distance-biregular graphs"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:32:30Z"}