Digital repository of Slovenian research organisations

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

Title:The Sierpiński domination number
Authors:ID Henning, Michael A. (Author)
ID Klavžar, Sandi (Author)
ID Kleszcz, Elżbieta (Author)
ID Pilśniak, Monika (Author)
Files:.pdf PDF - Presentation file, download (379,57 KB)
MD5: 54929780D0AEF0BB0051A93F1FF77163
 
URL URL - Source URL, visit https://amc-journal.eu/index.php/amc/article/view/2892
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$, consisting of $|V(G)|$ copies of $H$; for every edge $gg'$ of $G$ there is an edge between copies $gH$ and $g'H$ of $H$ associated with the vertices $g$ and $g'$ of $G$, respectively, of the form $(g,f(g'))(g',f(g))$. In this paper, we define the Sierpiński domination number as the minimum of $\gamma(G\otimes _f H)$ over all functions $f \colon V(G)\rightarrow V(H)$. The upper Sierpiński domination number is defined analogously as the corresponding maximum. After establishing general upper and lower bounds, we determine the upper Sierpiński domination number of the Sierpiński product of two cycles, and determine the lower Sierpiński domination number of the Sierpiński product of two cycles in half of the cases and in the other half cases restrict it to two values.
Keywords:Sierpiński graph, Sierpiński product, domination number, Sierpiński domination number
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2024
Year of publishing:2024
Number of pages:16 str.
Numbering:Vol. 24, no. 3, article no. P3.06
PID:20.500.12556/DiRROS-21308 New window
UDC:519.17
ISSN on article:1855-3966
DOI:10.26493/1855-3974.2892.f07 New window
COBISS.SI-ID:202296323 New window
Note:
Publication date in DiRROS:24.01.2025
Views:576
Downloads:386
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:Other - Other funder or multiple funders
Funding programme:South African National Research Foundation
Project number:132588

Funder:Other - Other funder or multiple funders
Funding programme:South African National Research Foundation
Project number:129265

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

Funder:ARRS - Slovenian Research Agency
Project number:J1-2452
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov

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

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
Keywords:graf Sierpińskega, Sierpińskijev produkt, dominacijsko število, Sierpińskijevo dominacijsko število


Back