Title of article :
The minimum number of vertices with girth 6 and degree set D={r,m} Original Research Article
Author/Authors :
Yang Yuansheng، نويسنده , , Weifa Liang، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
10
From page :
249
To page :
258
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
Keywords :
Cage , Girth , Degree set , Symmetric graph
Journal title :
Discrete Mathematics
Serial Year :
2003
Journal title :
Discrete Mathematics
Record number :
949214
Link To Document :
