Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Cherian, Merin; Mangam, Tabitha Agnes Title A name given to the resource Introduction to connecting coalitions Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550158; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925501587" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925501587</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105022625275?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105022625275?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant 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 Description An account of the resource 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. Subject The topic of the resource coalition partition; Connected graphs; induced subgraphs Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online