On minimal regular digraphs with girth 4

From MaRDI portal





Let f(r,g) denote the minimum number of vertices possible in an r-regular directed graph of girth g. \textit{M. Behzad, G. Chartrand}, and \textit{C. E. Wall} [Fundam. Math. 69, 227-231 (1970; Zbl 0203.265)] conjectured that \(f(r,g)=r(g-1)+1.\) The present authors show, among other things, that \(f(r,4)=3r+1\) for \(r\leq 23\) and that, in general, \(f(r,4)>2.85r+1.52.\)











This page was built for publication: On minimal regular digraphs with girth 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329497)