The girth of cubic graphs
We start with an account of the known bounds for n(3,g), the number of vertices in the smallest trivalent graph of girth g, for g ≤ 12, including the construction of the smallest known trivalent graph of girth 9. This particular graph has 58 vertices - the 32 known trivalent graphs with 60 vertices...
| Main Author: | |
|---|---|
| Published: |
Royal Holloway, University of London
1982
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.704504 |