Mixed cages: monotonicity, connectivity and upper bounds
From MaRDI portal
Publication:2113343
Abstract: A emph{-mixed cage} is a mixed graph -regular by arcs, -regular by edges, with girth and minimum order. %In this paper we study structural properties of mixed cages: Let denote the order of a -mixed cage. In this paper we prove that is a monotonicity function, with respect of , for , and we use it to prove that the underlying graph of a -mixed cage is 2-connected, for . We also prove that -mixed cages are strong connected. We present bounds of and constructions of -mixed graphs and show a -mixed cage of order .
Recommendations
Cites work
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- A family of mixed graphs with large order and diameter 2
- A new bound for the connectivity of cages
- A note on the edge-connectivity of cages
- All (k;g)-cages arek-edge-connected
- Connectivity of cages
- Dynamic cage survey
- Families of small regular graphs of girth 5
- Girth 5 graphs from elliptic semiplanes
- Mixed cages
- New small regular graphs of girth 5
- On Hamiltonian Regular Graphs of Girth Six
- On the connectivity of \((k,g)\)-cages of even girth
Cited in
(5)
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)