Back to search

University of Birmingham

Feasibility algorithms for distance-biregular graphs

Abstract

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 b0\(' < 20\). The feasible arrays with b0\(' < 10\) are analysed in Chapters 5 and 6; those with 10 \leq b0\(' < 20\) are listed in Appendix II. Our results raised a number of interesting questions which are listed at the end of Appendix II.

Degree

thesis:*
Name dc:type.qualificationname
d_ph
Level dc:type.qualificationlevel
d_ph
Grantor dc:publisher.institution
University of Birmingham
Year dc:date.issued
1989

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Secker, Peter Ronald

Subjects

dc:subject × 1

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
University of Birmingham
Base URL
etheses.bham.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Secker, Peter Ronald. Feasibility algorithms for distance-biregular graphs. d_ph thesis, University of Birmingham, 1989.