On the Restrained Cost Eective Sets of Some Special Classes of Graphs
Darwin P. Mangubat, Isagani S. Cabahug, Jr.
Asian Research Journal of Mathematics · pp. 22–34 · Published 22 Jun 2022
10.9734/arjom/2022/v18i830395Abstract
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 of a restrained cost effective set is the restrained cost effective number, CEr(G). In this paper, the restrained cost effective sets of paths, cycles, complete graphs, complete product of graphs and graphs resulting from line graph of graphs with maximum degree of 2 were characterized. As a direct consequence, the bounds or exact values for the restrained cost effective number were determined as well.
Cited by 2
Kyle Kenneth B. Ruaya, Isagani S. Cabahug, R. Eballe · Asian Research Journal of Mathematics · 2022
Marvanessa G. Dinorog, I. Jr. · Asian Research Journal of Mathematics · 2022
Related research
- Comparative Analysis of Empirical Formulae Used in Groundwater Recharge in Ogun – Oshun River Basins — shares topic coverage
- Covering of Line Graph of Zero Divisor Graph over Ring Zn — shares topic coverage
- On the Pendant Number of Certain Graphs — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.