Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

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 PDF - Presentation file, download (639,02 KB)
MD5: 5164ED1AF41B5B2529BBC72164929F38
 
URL URL - Source URL, visit https://amc-journal.eu/index.php/amc/article/view/3389
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order $n$ is at most $\lceil \frac13 n \rceil$, 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 $\gamma(G) < n_0 + \frac{3}{4} n_1 + \frac{11}{20} n_2 + \frac{7}{20} n_3$, where $n_i$ denotes the number of vertices in $G$ of degree $i$, for $i \in \{0,1,2,3\}$. We also prove that if $G$ is a subcubic planar graph with girth at least $9$, then $\gamma(G) < n_0 + \frac{13}{17} n_1 + \frac{9}{17} n_2 + \frac{6}{17} n_3$.
Keywords:graph theory, domination, subcubic planar graph, upper bound
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2026
Year of publishing:2026
Number of pages:32 str.
Numbering:Vol. 26, no. 2, article no. P2.08
PID:20.500.12556/DiRROS-28409 New window
UDC:519.17
ISSN on article:1855-3966
DOI:10.26493/1855-3974.3389.86c New window
COBISS.SI-ID:225914883 New window
Note:
Publication date in DiRROS:18.03.2026
Views:275
Downloads:138
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
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:Društvo matematikov, fizikov in astronomov, Društvo matematikov, fizikov in astronomov, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije
ISSN:1855-3966
COBISS.SI-ID:239049984 New window

Document is financed by a project

Funder:Ministry of Education, National Research Foundation of Korea
Funding programme:Basic Science Research Program
Project number: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
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.

Back