1. Extremal totally regular mixed graphs and partially oriented incidence graphs of projective and biaffine planesTatiana Bagin Jajcay, Robert Jajcay, György Kiss, István Porupsánszki, 2025, izvirni znanstveni članek Opis: 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.
Ključne besede: totally regular mixed graph, girth, projective plane, biaffine plane
Objavljeno v RUP: 04.06.2026; Ogledov: 377; Prenosov: 14
 Celotno besedilo (480,02 KB)
Gradivo ima več datotek! Več... |
2. Totally regular mixed graphs constructed from the CD(n,q) graphs of Lazebnik, Ustimenko and WoldarTatiana Jajcayova, Robert Jajcay, 2025, izvirni znanstveni članek Opis: The CD(n,q) graphs are connected components of q-regular graphs D(n,q) introduced in 1995 by Lazebnik and Ustimenko. They constitute the best universal family of regular graphs of prime power degree with regard to the Cage Problem which calls for determining the orders of the smallest k-regular graphs of girth g. The girths of the CD(n,q) graphs are known to be at least n+4 in case of even n, and n+5 for odd n. We propose to extend the use of the CD(n,q) graphs into the area of mixed graphs by adding directions to certain edges of the C(n,q)graphs.
In the context of mixed graphs, graphs in which the number of incident non-oriented edges is the same for all vertices, and the numbers of out-going and in-going edges are also equal and the same for all vertices, are of special interest and are called totally regular mixed graphs. In view of the special properties of the original C(n,q) graphs with regard to cages, we believe that the totally regular mixed graphs we propose to study may also prove to be extremal with regard to properties sought for in the area of mixed graphs.
Ključne besede: cage problem, girth, degree, mixed graphs
Objavljeno v RUP: 03.11.2025; Ogledov: 1041; Prenosov: 7
Celotno besedilo (574,95 KB) |
3. |
4. |
5. |
6. |
7. |
8. |
9. |
10. |
