Digital repository of Slovenian research organisations

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

Title:Partial domination in supercubic graphs
Authors:ID Bujtás, Csilla (Author)
ID Henning, Michael A. (Author)
ID Klavžar, Sandi (Author)
Files:URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0012365X23003552
 
.pdf PDF - Presentation file, download (304,87 KB)
MD5: ACE2EBE8F78937B8559A1EBDBF9D5E0F
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:For some α with 0<α≤1, a subset X of vertices in a graph G of order n is an α-partial dominating set of G if the set X dominates at least α×n vertices in G. The α-partial domination number pdα(G) of G is the minimum cardinality of an α-partial dominating set of G. In this paper partial domination of graphs with minimum degree at least 3 is studied. It is proved that if G is a graph of order n and with δ(G)≥3, then pd78(G)≤13n. If in addition n≥60, then pd910(G)≤13n, and if G is a connected cubic graph of order n≥28, then pd1314(G)≤13n. Along the way it is shown that there are exactly four connected cubic graphs of order 14 with domination number 5.
Keywords:domination, partial domination, cubic graphs, supercubic graphs
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2024
Year of publishing:2024
Number of pages:11 str.
Numbering:Vol. 347, iss. 1, article no. 113669
PID:20.500.12556/DiRROS-18189 New window
UDC:519.17
ISSN on article:0012-365X
DOI:10.1016/j.disc.2023.113669 New window
COBISS.SI-ID:162890243 New window
Publication date in DiRROS:15.02.2024
Views:669
Downloads:307
Metadata:XML DC-XML DC-RDF
:
BUJTÁS, Csilla, HENNING, Michael A. and KLAVŽAR, Sandi, 2024, Partial domination in supercubic graphs. Discrete mathematics [online]. 2024. Vol. 347, no. 1,  113669. [Accessed 7 April 2025]. DOI 10.1016/j.disc.2023.113669. Retrieved from: https://dirros.openscience.si/IzpisGradiva.php?lang=eng&id=18189
Copy citation
  
Share:Bookmark and Share


Similar works from our repository:

No similar works found
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:Discrete mathematics
Shortened title:Discrete math.
Publisher:Elsevier
ISSN:0012-365X
COBISS.SI-ID:1118479 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:P1-0297-2022
Name:Teorija grafov
Funder:ARRS - Slovenian Research Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:J1-2452-2020
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov
Funder:ARRS - Slovenian Research Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:N1-0285-2023
Name:Metrični problemi v grafih in hipergrafih
Funder:Other - Other funder or multiple funders
Funding programme:University of Johannesburg
Funder:Other - Other funder or multiple funders
Funding programme:South Africa, National Research Foundation

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:dominacija, delna dominacija, kubični grafi, superkubični grafi


Back