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 Cruz, Marie Serene D.; Sangeetha, V. Title A name given to the resource k-Domination Connectivity in Graphs 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 International Journal of Foundations of Computer Science; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S0129054125500431" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S0129054125500431</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105023179512?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105023179512?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 Cruz M.S.D., Centre for Mathematical Needs, Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Sangeetha V., Centre for Mathematical Needs, Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource The conditional connectivity of G with respect to a graph theoretic property P is the smallest cardinality of a set S of vertices (edges), if any, such that every component Hi of the disconnected graph G ? S has property P. Connectivity and domination are two major areas of graph theory having numerous applications in computer and information sciences. In this paper, we study a type of conditional connectivity that combines connectivity and domination, called k-domination connectivity. Further, we investigate the k-domination connectivity of some standard graph classes. 2025 World Scientific Publishing Company. Subject The topic of the resource conditional connectivity; connectivity; domination; k-domination connectivity; k-domination vertex cut Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 1290541; 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