On the Restrained Cost Eective Sets of Some Special Classes of Graphs
Darwin P. Mangubat & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2022
Let G be a nontrivial, undirected, simple graph. Let S be a subset of V (G). S is a restrained cost effective set of G if for each vertex v in S, degS(v) \(\leq\) degV (G)rS(v) and the subgraph induced by the vertex set, V (G) r S has no isolated vertex. The maximum cardinality o...
Open access
Research Article
10.9734/arjom/2022/v18i830395