Digital repository of Slovenian research organisations

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

Title:On independent coalition in graphs and independent coalition graphs
Authors:ID Alikhani, Saeid (Author)
ID Bakhshesh, Davood (Author)
ID Golmohammadi, Hamidreza (Author)
ID Klavžar, Sandi (Author)
Files:.pdf PDF - Presentation file, download (157,79 KB)
MD5: 8E4F9FEA681D3CB726E06E9DA36538B1
 
URL URL - Source URL, visit https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2543
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:An independent coalition in a graph $G$ consists of two disjoint, independent vertex sets $V_1$ and $V_2$, such that neither $V_1$ nor $V_2$ is a dominating set, but the union $V_1\cup V_2$ is an independent dominating set of $G$. An independent coalition partition of $G$ is a partition $\{V_1, \ldots, V_k\}$ of $V(G)$ such that for every $i\in [k]$, either the set $V_i$ consists of a single dominating vertex of $G$, or $V_i$ forms an independent coalition with some other part $V_j$. The independent coalition number $IC(G)$ of $G$ is the maximum order of an independent coalition of $G$. The independent coalition graph ${\rm ICG}(G,\pi)$ of $\pi=\{V_1, \ldots, V_k\}$ (and of $G$) has the vertex set $\{V_1,\ldots, V_k\}$, vertices $V_i$ and $V_j$ being adjacent if $V_i$ and $V_j$ form an independent coalition in $G$. In this paper, a large family of graphs with $IC(G) = 0$ is described and graphs $G$ with $IC(G)\in \{n(G), n(G)-1\}$ characterized. Some properties of ${\rm ICG}(G,\pi)$ are presented. The independent coalition graphs of paths are characterized, and the independent coalition graphs of cycles described.
Keywords:dominating set, independent set, independent coalition, independent coalition number, independent coalition graphs
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2025
Year of publishing:2025
Number of pages:str. 533-544
Numbering:Vol. 45, no. 2
PID:20.500.12556/DiRROS-21951 New window
UDC:519.17
ISSN on article:1234-3099
DOI:10.7151/dmgt.2543 New window
COBISS.SI-ID:232324611 New window
Note:
Publication date in DiRROS:11.04.2025
Views:617
Downloads:356
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:Discussiones mathematicae : Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

Funder:Russian Science Foundation
Project number:23-21-00459

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

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2452
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

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:dominacijska množica, neodvisna množica, neodvisna koalicija, neodvisnostno koalicijsko število, grafi neodvisnih koalicij


Back