
arXiv: 2207.05904
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
05c35, 05c38, 05c20, Extremal problems in graph theory, mathematics - combinatorics, cage, voltage graph, Directed graphs (digraphs), tournaments, g.2.2, Computational methods for problems pertaining to combinatorics, G.2.2, mixed graph, girth, 05C35, 05C38, 05C20, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, Mathematics
05c35, 05c38, 05c20, Extremal problems in graph theory, mathematics - combinatorics, cage, voltage graph, Directed graphs (digraphs), tournaments, g.2.2, Computational methods for problems pertaining to combinatorics, G.2.2, mixed graph, girth, 05C35, 05C38, 05C20, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
