Introduction to total coalitions in graphs

MaRDI QIDQ6417994zbMATH OpenFDO

Authors Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi

Publication date 21 November 2022

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: Let $G$ be a graph with vertex set $V$. Two disjoint sets $V_1,V_{2}subseteqV$ are called a total coalition in $G$, if neither $V_1$ and $V_2$ is a total dominating set of $G$ but $V_{1}cup{V}_2$ is a total dominating set. A total coalition partition of $G$ is a vertex partition $pi=V_1,V_2,ldots,V_k$ such that no set of $pi$ is a total dominating set but each set $V_{i}inpi$ forms a total coalition with another set $V_{j}inpi$. The maximum cardinality of a total coalition partition of $G$ is called the total coalition number of $G$, denoted by $TC(G)$. In this paper, we initiate the study of the total coalition in graphs and its properties.

This page was built for publication: Introduction to total coalitions in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417994)