Regularity and transitivity in graphs
Graphs with high regularity and transitivity conditions are studied. The first graphs considered are graphs where each vertex has an intersection array (possibly differing from that of other vertices). These graphs are called distance-regularised and are shown to be distance-regular or bipartite wit...
| Main Author: | |
|---|---|
| Published: |
Royal Holloway, University of London
1985
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561413 |