Mixed cages: monotonicity, connectivity and upper bounds

From MaRDI portal
Publication:2113343

DOI10.1016/J.DISC.2021.112792zbMATH Open1484.05114arXiv2009.13709OpenAlexW4229077714MaRDI QIDQ2113343FDOQ2113343


Authors: G. Araujo-Pardo, Claudia De la Cruz, Diego González-Moreno Edit this on Wikidata


Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A emph{[z,r;g]-mixed cage} is a mixed graph z-regular by arcs, r-regular by edges, with girth g and minimum order. %In this paper we study structural properties of mixed cages: Let n[z,r;g] denote the order of a [z,r;g]-mixed cage. In this paper we prove that n[z,r;g] is a monotonicity function, with respect of g, for zin1,2, and we use it to prove that the underlying graph of a [z,r;g]-mixed cage is 2-connected, for zin1,2. We also prove that [z,r;g]-mixed cages are strong connected. We present bounds of n[z,r;g] and constructions of [z,r;5]-mixed graphs and show a [10,3;5]-mixed cage of order 50.


Full work available at URL: https://arxiv.org/abs/2009.13709




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Mixed cages: monotonicity, connectivity and upper bounds

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