Digital repository of Slovenian research organisations

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

Title:2-rainbow independent domination in complementary prisms
Authors:ID Božović, Dragana (Author)
ID Radić, Gordana (Author)
ID Tepeh, Aleksandra (Author)
Files:.pdf PDF - Presentation file, download (366,61 KB)
MD5: 2642E69DD7AF494D32790AD0C3C92684
 
URL URL - Source URL, visit https://dk.um.si/IzpisGradiva.php?id=92600
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:A function $f$ that assigns values from the set $\{0, 1, 2\}$ to each vertex of a graph is called a $2$-rainbow independent dominating function, if the vertices assigned the value $1$ form an independent set, the vertices assigned the value $2$ form another independent set, and every vertex to which $0$ is assigned has at least one neighbor in each of the mentioned independent sets. The weight of this function is the total number of vertices assigned nonzero values. The $2$-rainbow independent domination number of $G$, $\gamma_{{\rm ri}2}(G)$, is the minimum weight of such a function. Motivated by a real-life application, we study the $2$-rainbow independent domination number of the complementary prism $G \overline{G}$ of a graph $G$, which is constructed by taking $G$ and its complement $\overline{G}$, and then adding edges between corresponding vertices. We provide tight bounds for $\gamma_{{\rm ri}2}(G \overline{G})$, and characterize graphs for which the lower bound, i.e. $\max \{ \gamma_{{\rm ri}2}(G), \gamma_{{\rm ri}2}(\overline{G})\}+1$, is attained. The obtained results can, in practice, enable the prediction of the cost estimate for a given communication or surveillance network.
Keywords:graph theory, domination, 2-rainbow independent domination, complementary prism
Publication status:Published
Publication version:Version of Record
Publication date:01.04.2025
Year of publishing:2025
Number of pages:13 str.
Numbering:Vol. 44, iss. 5, [article no.] 235
PID:20.500.12556/DiRROS-22123 New window
UDC:519.17
ISSN on article:1807-0302
DOI:10.1007/s40314-025-03189-9 New window
COBISS.SI-ID:233075971 New window
Note:
Publication date in DiRROS:28.04.2025
Views:560
Downloads:277
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:Computational & Applied Mathematics
Shortened title:Comput. Appl. Math.
Publisher:Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:1807-0302
COBISS.SI-ID:520491801 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0288
Name:Algebra in njena uporaba

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P2-0065
Name:Telematika

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:teorija grafov, dominacija


Back