On the Coalition Number of the dth Power of the n-Cycle
Open Access
- 29 May 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1822
Abstract
A coalition in a graph G consists of two disjoint sets of vertices and , neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G is a vertex partition such that every set is not a dominating set but forms a coalition with another set which is not a dominating set. The coalition number equals the maximum k of a coalition partition of G. In this paper, we study the coalition number of the dth power of the n-cycle , where and . We show that for or , and also provide some bounds of for the other cases. As a special case, we obtain the exact value of the coalition number of .
Keywords
This publication has 6 references indexed in Scilit:
- On cubic graphs having the maximum coalition numberSibirskie Elektronnye Matematicheskie Izvestiya, 2024
- The shortest cycle having the maximal number of coalition graphsDiscrete Mathematics Letters, 2024
- On the Coalition Number of TreesBulletin of the Malaysian Mathematical Sciences Society, 2023
- Self-coalition graphsOpuscula Mathematica, 2023
- Coalition graphs of paths, cycles, and treesDiscussiones Mathematicae Graph Theory, 2023
- Introduction to coalitions in graphsAKCE International Journal of Graphs and Combinatorics, 2020