Skip to content

Author

Mercedita A. Langamin

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access 2026

Certified Weakly Connected Domination in Graphs.

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)...

Jamil J. Hamja, Faizal S. Hajal, Mercedita A. Langamin et al. · 0 citations
Open access 2026

A New Variant of HOP Independence.

Let G=(V(G), E(G)) be a simple and undirected graph. Then P \subseteq V(G) is called a 2-distance certified hop independent set of G if P is a hop independent and for every vertex v in P, v has either zero or at least two hop neighbors in V(G) \setminus P. The 2-distance certified hop independence number of G, denoted...

Javier Hassan, Albenhar Maali, Mercedita A. Langamin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.