| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Orientable domination in product-like graphs
Authors:ID Anderson, Sarah (Author)
ID Brešar, Boštjan (Author)
ID Klavžar, Sandi (Author)
ID Kuenzel, Kirsti (Author)
ID Rall, Douglas F. (Author)
Files:URL https://www.sciencedirect.com/science/article/pii/S0166218X22004267
 
.pdf Orientable_domination_in_product-Anderson-2023.pdf (419,38 KB)
MD5: DE626438FD926D061B0EBFDD7A0AA558
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:The orientable domination number, ▫${\rm DOM}(G)$▫, of a graph ▫$G$▫ is the largest domination number over all orientations of ▫$G$▫. In this paper, ▫${\rm DOM}$▫ is studied on different product graphs and related graph operations. The orientable domination number of arbitrary corona products is determined, while sharp lower and upper bounds are proved for Cartesian and lexicographic products. A result of Chartrand et al. from 1996 is extended by establishing the values of ▫${\rm DOM}(K_{n_1,n_2,n_3})$▫ for arbitrary positive integers ▫$n_1,n_2$▫ and ▫$n_3$▫. While considering the orientable domination number of lexicographic product graphs, we answer in the negative a question concerning domination and packing numbers in acyclic digraphs posed in [Domination in digraphs and their direct and Cartesian products, J. Graph Theory 99 (2022) 359-377].
Keywords:digraph, domination, orientable domination number, packing, graph product, corona graph
Publication status:Published
Publication version:Version of Record
Publication date:01.02.2023
Year of publishing:2023
Number of pages:str. 62-69
Numbering:Vol. 326
PID:20.500.12556/DKUM-84934 New window
UDC:519.17
ISSN on article:0166-218X
COBISS.SI-ID:135012355 New window
DOI:10.1016/j.dam.2022.11.003 New window
Publication date in DKUM:09.08.2023
Views:577
Downloads:65
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
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:Discrete applied mathematics
Shortened title:Discrete appl. math.
Publisher:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 New window

Document is financed by a project

Funder:Other - Other funder or multiple funders
Project number:BI-US/22-24-038
Name:Domination in graphs, digraphs and their products

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

Funder:ARRS - Slovenian Research Agency
Project number:J1-3002
Name:Prirejanja in barvanja povezav v kubičnih grafih

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Title:Orientabilna dominacija v grafih produktnega tipa
Abstract:Orientabilno dominantno število, ▫${\rm DOM}(G)$▫, grafa ▫$G$▫ je največje dominantno število poljubne orientacije grafa ▫$G$▫. V tem članku število ▫${\rm DOM}(G)$▫ raziskujemo na različnih produktih grafov ter ob uporabi različnih operacij nad grafi. Za poljubno korono dveh grafov natanko določimo njeno orientabilno dominantno število, medtem ko za kartezični in leksikografski produkt grafov določimo ostre spodnje in zgornje meje. Rezultat Chartranda in soavtorjev (1996) razširimo tako, da določimo vrednosti ▫${\rm DOM}(K_{n_1,n_2,n_3})$▫, kjer so ▫$n_1, n_2$▫ in ▫$n_3$▫ poljubna naravna števila. Ob obravnavi orientabilnega dominantnega števila leksikografskih produktov grafov pridemo tudi do negativnega odgovor na vprašanje iz članka Brešarja in soavtorjev (2022), ki se nanaša na dominantno in pakirno število acikličnih usmerjenih grafov.
Keywords:usmerjeni graf, dominacija, orientabilno dominantno število, pakiranje, grafovski produkt, korona


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