Skip navigation
Skip navigation

The minimum number of vertices with girth 6 and degree set D={r,m}

Yuansheng, Yang; Liang, Weifa


A (D;g)-cage is a graph having the minimum number of vertices, with degree set D and girth g. Denote by f(D;g) the number of vertices in a (D;g)-cage. In this paper it is shown that f({r,m};6)≥2(rm-m+1) for any 2≤r

CollectionsANU Research Publications
Date published: 2003
Type: Journal article
Source: Discrete Mathematics
DOI: 10.1016/S0012-365X(02)00758-6


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator