Coalition of cubic graphs of order at most 10

Publication date 20 December 2022

Abstract: The coalition in a graph

G

consists of two disjoint sets of vertices

V_{1}

and

V_{2}

, neither of which is a dominating set but whose union

V_{1} c u p V_{2}

, is a dominating set. A coalition partition in a graph

G

is a vertex partition

p i

=

V_{1}, V_{2}, ..., V_{k}

such that every set

V_{i} i n p i

is not a dominating set but forms a coalition with another set

V_{j} i n p i

which is not a dominating set. The coalition number

C (G)

equals the maximum

k

of a coalition partition of

G

. In this paper, we compute the coalition number of all cubic graphs of order at most

10

.

This page was built for publication: Coalition of cubic graphs of order at most $10$