Lupa

Show document Help

A- | A+ | Print
Title:Semicubic cages and small graphs of even girth from voltage graphs
Authors:ID Aguilar, Flor (Author)
ID Araujo-Pardo, Gabriela (Author)
ID Berman, Leah (Author)
Files:.pdf AMC__Aguilar,_Araujo-Pardo,_Berman_2026.pdf (574,36 KB)
MD5: 2C052305463C4C1BBAA520CB216BA3C5
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:A ({3, m}; g)-semicubic graph is a graph where the degree of each vertex is either 3 or m and the girth of the graph is g; if m = 3 we have a cubic graph. In this paper, we construct families of semicubic graphs of even girth and small order using two different techniques. The first technique generalizes a previous construction, which glues cubic cages of girth g together at remote vertices (vertices at distance at least g/2). The second technique, the main content of this paper, produces bipartite semicubic ({3, m}; g)-graphs of even girth g using voltage graphs over ℤm. For girth g = 4t + 2, t ≥ 1, the constructed graphs have two vertices of degree m. For girth g = 4t, t ≥ 2, the construction produces graphs with exactly three vertices of degree m (of course, the remaining vertices are of degree 3 in both cases). In particular, we describe infinite families of ({3, m}; g)−semicubic graphs for g = {6, 8, 10, 12} for infinitely many values of m. The cases g = {6, 8} include the unique 6-cage and the unique 8-cage when m = 3. The families obtained in this paper for girth g = {10, 12} include examples of orders that match the best-known bounds for ({3, m}; g)−semicubic graphs until this moment.
Keywords:Graph, semicubic graph, girth, voltage graph
Publication status:Published
Publication version:Version of Record
Publication date:02.06.2026
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:30 str.
Numbering:Vol. 26, no. 3, [article no.] P3.03
PID:20.500.12556/RUP-23505 This link opens in a new window
UDC:51
eISSN:1855-3974
DOI:10.26493/1855-3974.3116.35e This link opens in a new window
Publication date in RUP:17.08.2026
Views:85
Downloads:1
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:Ars mathematica contemporanea
Publisher:Založba Univerze na Primorskem
ISSN:1855-3974

Document is financed by a project

Funder:PAPIIT-Mexico
Project number:IN108121

Funder:PAPIIT-Mexico
Project number:IN113324

Funder:SECHITI
Project number:CBF2023-2024-552

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:Polkubične kletke in majhni grafi s sodo ožino, izpeljani iz napetostnih grafov
Abstract:Graf G imenujemo polkubični ({3, m}; g)-graf, če ima vsako njegovo vozlišče stopnjo bodisi 3 bodisi m, ožina grafa pa je enaka g; za m = 3 dobimo kubični graf. V tem članku konstruiramo družine polkubiˇcnih grafov s sodo ožino in majhnim številom vozlišč z uporabo dveh različnih tehnik. Prva tehnika posplošuje predhodno konstrukcijo, pri kateri se kubične kletke ožine g zlepijo v oddaljenih vozliščih (tj. v vozliščih na medsebojni razdalji vsaj g/2). Druga tehnika, ki predstavlja osrednjo vsebino tega članka, uporablja napetostne grafe nad grupo Zm za konstrukcijo bipartitnih polkubičnih ({3, m}; g)-grafov s sodo ožino g. Za ožino g = 4t + 2, t ≥ 1, imajo skonstruirani grafi dve vozlišči stopnje m. Za ožino g = 4t, t ≥ 2, konstrukcija daje grafe z natanko tremi vozlišči stopnje m (v obeh primerih imajo vsa preostala vozlišˇca stopnjo 3). Posebej opišemo neskončne družine polkubičnih ({3, m}; g)-grafov za g ∈ {6, 8, 10, 12} in neskončno mnogo vrednosti parametra m. Primera g ∈ {6, 8} vključujeta enolično 6-kletko oziroma enolično 8-kletko, kadar je m = 3. Družine grafov, dobljene v tem članku za ožino g ∈ {10, 12}, vsebujejo primere z redi, ki dosegajo trenutno najboljše znane meje za polkubične ({3, m}; g)-grafe.
Keywords:Graf, polkubični graf, ožina, napetostni graf


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