<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05992288</id>
  <dt>j</dt>
  <an>05992288</an>
  <augroup>
    <au>Balbuena, C.</au>
    <au>Marcote, X.</au>
  </augroup>
  <ti>Monotonicity of the order of $(D;g)$-cages.</ti>
  <so>Appl. Math. Lett. 24, No. 11, 1933-1937 (2011).</so>
  <py>2011</py>
  <pu>Elsevier Science Ltd. (Pergamon), Oxford</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>cage</ut>
    <ut>degree set</ut>
    <ut>girth</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.aml.2011.05.024</li>
  </ligroup>
  <abgroup>
    <ab>Summary: A $(D;g)$-cage is a graph having degree set $D$, girth $g$, and the minimum possible number of vertices, which is denoted by $n(D;g)$. When $D=\{r\}$ the corresponding $(\{r\};g)$-cage is clearly $r$-regular, and is called an $(r;g)$-cage. In this work we prove that if $g<g^{\prime}$ then $n(D;g)<n(D;g^{\prime})$ under certain requirements on the elements of the degree set $D$ or on the girth $g$.</ab>
    <rv></rv>
  </abgroup>
</item>