Leocint F. Consistente

Hinge Total Domination on Some Graph Families

Leocint F. Consistente & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2022

set S of vertices in a graph G = (V (G);E(G)) is a hinge dominating set if every vertex \(u\) \(\in\) V \(\setminus \) \(S\) is adjacent to some vertex \(u\) \(\in\) \(S\) and a vertex \(w\) \(\in\) V \(\setminus\) \(S\)  such that (\(v\), \(w\)) is not an edge in E(G). The hinge...