Lupa

Show document Help

A- | A+ | Print
Title:Extremal totally regular mixed graphs and partially oriented incidence graphs of projective and biaffine planes
Authors:ID Bagin Jajcay, Tatiana (Author)
ID Jajcay, Robert (Author)
ID Kiss, György (Author)
ID Porupsánszki, István (Author)
Files:.pdf RAZ_Bagin_Jajcay_Tatiana_2025.pdf (480,02 KB)
MD5: EC001DB3F6C5C07B4326B7EA118BC9C4
 
URL https://link.springer.com/article/10.1007/s00026-025-00788-5
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
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.
Keywords:totally regular mixed graph, girth, projective plane, biaffine plane
Publication version:Author Accepted Manuscript
Year of publishing:2025
Number of pages:str. 1-19
Numbering:Vol.
PID:20.500.12556/RUP-23108 This link opens in a new window
UDC:519.17
ISSN on article:0218-0006
DOI:10.1007/s00026-025-00788-5 This link opens in a new window
COBISS.SI-ID:280518403 This link opens in a new window
Publication date in RUP:04.06.2026
Views:61
Downloads:2
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Annals of combinatorics
Shortened title:Ann. comb.
Publisher:Springer Singapore, Birkhäuser
ISSN:0218-0006
COBISS.SI-ID:8204633 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Abstract:Graf (r,z;g)-mešanega tipa je graf, ki vsebuje tako povezave (neusmerjene povezave) kot loke (usmerjene povezave) ter zadošča pogoju regularnosti, da je vsak incidenten z r povezavami, z vhodnimi in z izhodnimi loki (t. i. popolna regularnost). Graf ima usmerjeni obseg g, kar pomeni, da vsebuje usmerjeni cikel dolžine g, ne vsebuje pa nobenega krajšega usmerjenega cikla. Problem, obravnavan v tem članku, je analogen problemu kletke (Cage Problem) in se nanaša na določitev reda najmanjših popolnoma regularnih (r,z;g)-mešanih grafov. Izpeljemo več zgornjih in spodnjih mej za rede takšnih minimalnih grafov, preučimo povezave med temi ekstremalnimi grafi in njihovimi neusmerjenimi oziroma digrafskimi ustrezniki ter se osredotočimo na lastnosti popolnoma regularnih mešanih grafov, dobljenih z zamenjavo nekaterih povezav v incidenčnih grafih projektivnih in biafinih ravnin z loki. Poleg tega predstavimo dve konstrukciji, ki temeljita na dodajanju novih povezav ali lokov v inducirane podgrafe teh incidenčnih grafov.
Keywords:popolnoma regularen mešani graf, obseg grafa, projektivna ravnina, biafina ravnina


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica