Introduction to connecting coalitions

Title

Introduction to connecting coalitions

Creator

Cherian, Merin; Mangam, Tabitha Agnes

Description

A connecting coalition in a graph G(V;E) consists of two disjoint vertex subsets V1 and V2 of V (G), where neither G[V1] nor G[V2] is a connected graph but G[V1 [V2] is a con- nected graph. A connecting coalition partition is a vertex partition ? = fV1; V2; : : : ; Vkg, and the maximum cardinality of all possible ? is called the connecting coalition number, ?(G). Some bounds on the coalition number ?(G) are found, and graphs having ?(G) = 2 are characterized. Further, the existence of connecting coalition partitions in graphs is explored. 2025 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550158;

Date

01-01-2025

Publisher

World Scientific

Subject

coalition partition; Connected graphs; induced subgraphs

Coverage

Cherian M., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India; Mangam T.A., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17938309;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925501587

https://www.scopus.com/pages/publications/105022625275?origin=resultslist