Work

Certified Weakly Connected Domination in Graphs.

Year: 2026

Type: article

Abstract: Let G be a simple connected graph. We introduce certified weakly connected domination, where each vertex in a weakly connected dominating set S has either zero or at least two neighbors outside S. We establish fundamental relationships and determine the certified weakly connected domination number \gamma^{wc}_{cer}(G) for several graph classes and joins of graphs.

Source: International journal of mathematics and computer science

DOI: 10.69793/ijmcs/04.2026/hhll

Authors: Jamil Hamja, Faizal Hajal, Mercedita Langamin, Amy Laja

Institution: Mindanao State University - Tawi-Tawi College of Technology and Oceanography

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W7213636818

FWCI:

Cites:

Cited by:

Related to: 10