The minimum number of vertices with girth 6 and degree set D={r,m}
Date
2003
Authors
Yuansheng, Yang
Liang, Weifa
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
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<m, and f({r,m};6)=2(rm-m+1) if eithe
Description
Keywords
Keywords: Functions; Mathematical models; Set theory; Symmetric graphs; Graph theory Cage; Degree set; Girth; Symmetric graph
Citation
Collections
Source
Discrete Mathematics
Type
Journal article