Lupa

Show document Help

A- | A+ | Print
Title:Domination of subcubic planar graphs with large girth
Authors:ID Cho, Eun-Kyung (Author)
ID Culver, Eric (Author)
ID Hartke, Stephen G. (Author)
ID Iršič Chenoweth, Vesna (Author)
Files:.pdf AMC_Cho,_Culver,_G._Hartke,_Irsic_Chenoweth_2026.pdf (635,04 KB)
MD5: D88CEF05F194BCF47F536A07C6B0A442
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order n is at most ⌈1/3n⌉, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture is false in general, but Henning and Dorbec showed that it holds for graphs with girth at least 9. Zhu and Wu stated an analogous conjecture for 2-connected cubic planar graphs. In this paper, we present a new upper bound for the domination number of subcubic planar graphs: if G is a subcubic planar graph with girth at least 8, then γ(G) < n₀ + 3/4 n₁ + 11/20 n₂ + 7/20 n₃, where n_i denotes the number of vertices in G of degree i, for i ∈ {0, 1, 2, 3}. We also prove that if G is a subcubic planar graph with girth at least 9, then γ(G) < n₀ + 13/17 n₁ + 9/17 n₂ + 6/17 n₃.
Keywords:domination, subcubic planar graph, upper bound
Publication status:Published
Publication version:Version of Record
Publication date:18.03.2026
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:32 str.
Numbering:Vol. 26, no. 2, [article no.] P2.08
PID:20.500.12556/RUP-23438 This link opens in a new window
UDC:51
eISSN:1855-3974
DOI:10.26493/1855-3974.3389.86c This link opens in a new window
Publication date in RUP:11.08.2026
Views:68
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:NSF - National Science Foundation
Funding programme:Directorate for Mathematical & Physical Sciences
Project number:1953985
Name:Graduate Research Workshops in Combinatorics

Funder:NRF - National Research Foundation of Korea
Project number:No. RS-2023-00244543

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARRS - Slovenian Research Agency
Project number:Z1-50003
Name:Igra policajev in roparja na grafih in geodetskih prostorih

Funder:ARRS - Slovenian Research Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARRS - Slovenian Research Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov

Funder:ARRS - Slovenian Research Agency
Project number:N1-0355
Name:Prirejanja, transverzale in hipergrafi

Funder:EC - European Commission
Funding programme:HE
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

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:Dominacija podkubičnih ravninskih grafov z veliko ožino
Abstract:Odkar je Reed leta 1996 domneval, da je dominacijsko število povezanega kubičnega grafa reda n največ ⌈1/3n⌉, je bilo dominacijsko število kubičnih grafov obsežno preučevano. Danes je znano, da domneva na splošno ne drži, vendar sta Henning in Dorbec pokazala, da velja za grafe z ožino vsaj 9. Zhu in Wu sta podala analogno domnevo za 2-povezane kubične ravninske grafe. V tem članku podamo novo zgornjo mejo za dominacijsko število podkubičnih ravninskih grafov: če je G podkubičen ravninski graf z ožino vsaj 8, potem velja γ(G) < n₀ + 3/4 n₁ + 11/20 n₂ + 7/20 n₃, kjer n_i označuje število vozlišč v G stopnje i, za i ∈ {0, 1, 2, 3}. Prav tako dokažemo, da za vsak podkubičen ravninski graf G z ožino vsaj 9 velja γ(G) < n₀ + 13/17 n₁ + 9/17 n₂ + 6/17 n₃.
Keywords:dominacija, podkubični ravninski graf, zgornja meja


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