Digital repository of Slovenian research organisations

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

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:.pdf PDF - Presentation file, download (366,61 KB)
MD5: 75412643A755D775B048FFDBDD0F94D4
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0166218X22004267
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
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/DiRROS-18486 New window
UDC:519.17
ISSN on article:0166-218X
DOI:10.1016/j.dam.2022.11.003 New window
COBISS.SI-ID:135012355 New window
Note:
Publication date in DiRROS:20.03.2024
Views:119
Downloads:54
Metadata:XML RDF-CHPDL 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: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: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

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

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
Keywords:usmerjeni graf, dominacija, orientabilno dominantno število, pakiranje, grafovski produkt, korona


Back