k-Domination Connectivity in Graphs

Title

k-Domination Connectivity in Graphs

Creator

Cruz, Marie Serene D.; Sangeetha, V.

Description

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.

Source

International Journal of Foundations of Computer Science;

Date

01-01-2025

Publisher

World Scientific

Subject

conditional connectivity; connectivity; domination; k-domination connectivity; k-domination vertex cut

Coverage

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

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 1290541;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S0129054125500431

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