| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:2-rainbow independent domination in complementary prisms
Authors:ID Božović, Dragana (Author)
ID Radić, Gordana (Author)
ID Tepeh, Aleksandra (Author)
Files:.pdf s40314-025-03189-9.pdf (366,59 KB)
MD5: A2CAEA14B34529029F11313265737FA1
 
URL https://link.springer.com/article/10.1007/s40314-025-03189-9#additional-information
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:A function f that assigns values from the set to each vertex of a graph G 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, , 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 of a graph G, which is constructed by taking G and its complement , and then adding edges between corresponding vertices. We provide tight bounds for , and characterize graphs for which the lower bound, i.e. , 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
Submitted for review:30.08.2024
Article acceptance date:15.03.2025
Publication date:11.04.2025
Publisher:Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) = Brazilian Society of Computational and Applied Mathematics (Springer)
Year of publishing:2025
Number of pages:13 str.
Numbering:Vol. 44, [article no.] 235
PID:20.500.12556/DKUM-92600 New window
UDC:519.17
ISSN on article:1807-0302
COBISS.SI-ID:233075971 New window
DOI:10.1007/s40314-025-03189-9 New window
Copyright:© The Author(s) 2025
Publication date in DKUM:23.04.2025
Views:180
Downloads:13
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: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-2022
Name:Teorija grafov

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

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P2-0065-2022
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


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