Extremal Totally Regular Mixed Graphs and Partially Oriented Incidence Graphs of Projective and Biaffine Planes

Source abstract

Abstract An ( r , z ; g )-mixed graph is a graph containing both edges and darts satisfying the regularity property that each vertex of the graph is incident to r edges, z ingoing and z outgoing darts (called total regularity), and being of oriented girth g , i.e., containing an oriented cycle of length g , and no shorter oriented cycles. The problem addressed in this paper is analogous to the Cage Problem and calls for determining the orders of the smallest totally regular ( r , z ; g )-mixed graphs. We derive several upper and lower bounds on the orders of such minimal graphs, study the relations between these extremal graphs and their non-oriented or digraphical counterparts, and focus on properties of totally regular mixed graphs obtained by replacing some of the edges of the incidence graphs of projective and biaffine planes by darts. We also introduce two constructions based on introducing additional edges or darts into induced subgraphs of these incidence graphs.