Lupa

Show document Help

A- | A+ | Print
Title:Totally regular mixed graphs constructed from the CD(n,q) graphs of Lazebnik, Ustimenko and Woldar
Authors:ID Jajcayova, Tatiana (Author)
ID Jajcay, Robert (Author)
Files:.pdf ADAM_Jajcayova_Tatiana_2025.pdf (574,95 KB)
MD5: E433B15ED1534EDD34DE6E1960B614DF
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract: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.
Keywords:cage problem, girth, degree, mixed graphs
Publication status:Published
Publication version:Version of Record
Publication date:19.05.2025
Publisher:Založba Univerze na Primorskem
Year of publishing:2025
Number of pages:12 str.
Numbering:Vol. 8, no. 3, [article no.] P3.03
PID:20.500.12556/RUP-22076 This link opens in a new window
UDC:519.17
eISSN:2590-9770
DOI:10.26493/2590-9770.1758.c16 This link opens in a new window
Publication date in RUP:03.11.2025
Views:246
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:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Document is financed by a project

Funder:VEGA
Project number:1/0437/23

Funder:Other - Other funder or multiple funders
Project number:APVV-23-0076

Funder:Other - Other funder or multiple funders
Project number:SK-AT-23-0019

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
Title:Popolnoma regularni mešani grafi, konstruirani iz CD(n, q) grafov Lazebnika, Ustimenka in Woldarja
Keywords:problem kletk, ožina, red, mešani grafi


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